Abstract
Three new theorems are proved in the paper, which give bounds for the number of edges in induced subgraphs of a special distance graph.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
P. Frankl and R. Wilson, “Intersection theorems with geometric consequences,” Combinatorica 1 (4), 357–368 (1981).
A. Raigorodskii, “Cliques and cycles in distance graphs and graphs of diameters,” in Discrete Geometry and Algebraic Combinatorics, Contemp. Math. (Amer. Math. Soc., Providence, RI, 2014), Vol. 625, pp. 93–109.
A. Raigorodskii, “Borsuk’s problem and the chromatic numbers of some metric spaces,” Russian Math. Surveys 56 (1 (337)), 103–139 (2001).
V. Boltyanski, H. Martini, and P. Soltan, Excursions Into Combinatorial Geometry (Springer- Verlag, Berlin, 1997).
A. M. Raigorodskii, “Around Borsuk’s hypothesis,” J. Math. Sci. 154 (4), 604–623 (2008).
A. V. Bobu, A. É. Kupriyanov, and A. M. Raigorodskii, “A generalization of Kneser graphs,” Math. Notes 107 (3), 392–403 (2020).
A. V. Berdnikov and A. M. Raigorodskii, “Bounds on Borsuk numbers in distance graphs of a special type,” Probl. Inform. Transm. 57 (2), 136–142 (2021).
P. A. Ogarok and A. M. Raigorodskii, “On stability of the independence number of a certain distance graph,” Probl. Inform. Transm. 56 (4), 345–357 (2020).
F. A. Pushnyakov and A. M. Raigorodskii, “Estimate of the number of edges in special subgraphs of a distance graph,” Math. Notes 107 (2), 322–332 (2020).
P. Frankl and Z. Füredi, “Forbidding just one intersection,” J. Combin. Theory Ser. A 39 (2), 160–176 (1985).
F. A. Pushnyakov, “On the number of edges in induced subgraphs of a special distance graph,” Math. Notes 99 (4), 545–551 (2016).
F. A. Pushnyakov, “A new estimate for the number of edges in induced subgraphs of a special distance graph,” Probl. Inform. Transm. 51 (4), 371–377 (2015).
F. A. Pushnyakov, On the Number of Edges in Induced Subgraphs of Special Graphs, Cand. Sci. (Phys.–Math.) Dissertation (2020) [in Russian].
F. A. Pushnyakov, “The number of edges in induced subgraphs of some distance graphs,” Math. Notes 105 (4), 582–591 (2019).
F. A. Pushnyakov and A. M. Raigorodskii, “Estimate of the number of edges in subgraphs of a Johnson graph,” Dokl. Math. 104 (1), 193–195 (2021).
L. E. Shabanov and A. M. Raigorodskii, “Turán type results for distance graphs,” Discrete Comput. Geom. 56 (3), 814–832 (2016).
L. É. Shabanov, “Turán type results for distance graphs in infinitesimal plane layer,” J. Math. Sci. 236 (5), 554–578 (2019).
Author information
Authors and Affiliations
Corresponding author
Additional information
Translated from Matematicheskie Zametki, 2022, Vol. 111, pp. 929–939 https://doi.org/10.4213/mzm13370.
Rights and permissions
About this article
Cite this article
Shubin, Y.K. On the Minimal Number of Edges in Induced Subgraphs of Special Distance Graphs. Math Notes 111, 961–969 (2022). https://doi.org/10.1134/S0001434622050303
Received:
Revised:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1134/S0001434622050303