Chromatic Numbers of Distance Graphs without Short Odd Cycles in Rational Spaces

Yu A. Demidovich*, M. E. Zhukovskii

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

1 Scopus citations

Abstract

Abstract: We prove the existence in rational spaces of distance graphs without short odd cycles whose chromatic number increases exponentially with the dimension of the space.

Original languageEnglish (US)
Pages (from-to)727-734
Number of pages8
JournalMathematical Notes
Volume109
Issue number5-6
DOIs
StatePublished - May 2021

Bibliographical note

Funding Information:
The proof of Theorem was supported by the Russian Foundation for Basic Research (science grant no. 18-01-00355) and by the program “Leading Scientific Schools” (grant no. NSh-2540.2020.1). The proof of Corollary was supported by the Grant of the Government of the Russian Federation for the state support of scientific research supervised by leading scientists (agreement no. 075-15-2019-1926).

Publisher Copyright:
© 2021, Pleiades Publishing, Ltd.

Keywords

  • chromatic number
  • distance graph
  • graph girth
  • linear-algebraic method

ASJC Scopus subject areas

  • General Mathematics

Fingerprint

Dive into the research topics of 'Chromatic Numbers of Distance Graphs without Short Odd Cycles in Rational Spaces'. Together they form a unique fingerprint.

Cite this