On the number of edges in induced subgraphs of a special distance graph

Authors: Pushnyakov F.A.¹
Affiliations:
1. Moscow Institute of Physics and Technology
Issue: Vol 99, No 3-4 (2016)
Pages: 545-551
Section: Article
URL: https://journals.rcsi.science/0001-4346/article/view/149299
DOI: https://doi.org/10.1134/S0001434616030275
ID: 149299

Cite item

Full Text

Open Access

Open Access
Restricted Access

Restricted Access

Access granted
Restricted Access

Restricted Access

Subscription Access

Abstract
About the authors
References
Supplementary files
Statistics

Abstract

We obtain new estimates for the number of edges in induced subgraphs of a special distance graph.

Keywords

distance graph, clique, cycle, coloring, Borsuk problem

About the authors

F. A. Pushnyakov

Moscow Institute of Physics and Technology

Author for correspondence.
Email: pushnyakoff28@yandex.ru
Russian Federation, Moscow

Supplementary files

Supplementary Files

Action

1. JATS XML

Copyright (c) 2016 Pleiades Publishing, Ltd.

TOP