Chromatic numbers of distance graphs without short odd cycles in rational spaces

DOI10.1134/S0001434621050060zbMath1467.05070OpenAlexW3180006743WikidataQ114075415 ScholiaQ114075415MaRDI QIDQ2037721

Publication date: 8 July 2021

Published in: Mathematical Notes (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1134/s0001434621050060

zbMATH Keywords

chromatic number distance graph graph girth linear-algebraic method

Mathematics Subject Classification ID

Paths and cycles (05C38) Coloring of graphs and hypergraphs (05C15) Distance in graphs (05C12)

Related Items (1)

On Ramsey numbers for arbitrary sequences of graphs

Cites Work

Unnamed Item
Unnamed Item
Unnamed Item
Estimate for the chromatic number of Euclidean space with several forbidden distances
Turán type results for distance graphs
Lower bound for the chromatic number of a rational space with metric $l_u$ and with one forbidden distance
Distance graphs with large chromatic numbers and small clique numbers
Distance graphs with large chromatic number and without large cliques
On a Frankl-Wilson theorem
Estimate of the number of edges in special subgraphs of a distance graph
New bounds on clique-chromatic numbers of Johnson graphs
Distance graphs with large chromatic number and without cliques of given size in the rational space
On the independence numbers of some distance graphs with vertices in $\{-1, 0, 1\}^n$
Clique chromatic numbers of intersection graphs
A remark on lower bounds for the chromatic numbers of spaces of small dimension with metrics $\ell_1$ and $\ell_2$
New lower bound for the chromatic number of a rational space with one and two forbidden distances
On the chromatic numbers of low-dimensional spaces
Borsuk's problem and the chromatic numbers of some metric spaces
Coloring Distance Graphs and Graphs of Diameters
Graph Theory and Probability
On distance graphs with large chromatic number but without large simplices
On the Frankl–Rödl theorem
The chromatic number of a space with the metric $ l_q$
О рациональных аналогах проблем Нелсона - Хадвигера
Ramsey theory in the -space with Chebyshev metric
A new lower bound for the chromatic number of the rational space
Explicit and probabilistic constructions of distance graphs with small clique numbers and large chromatic numbers
The realization of distances within sets in Euclidean space
On the chromatic numbers of small-dimensional Euclidean spaces
Embedding graphs in Euclidean space

This page was built for publication: Chromatic numbers of distance graphs without short odd cycles in rational spaces