Coloring some finite sets in {R}^{n}

DOI10.7151/dmgt.1641zbMath1296.05066OpenAlexW2072816749MaRDI QIDQ2866446

József Balogh, Andrei M. Raigorodskii, Alexandr V. Kostochka

Publication date: 13 December 2013

Published in: Discussiones Mathematicae Graph Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.7151/dmgt.1641

zbMATH Keywords

independence numberchromatic numberdistance graph

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Related Items (20)

On chromatic numbers of close-to-Kneser distance graphs ⋮ Independence numbers of random subgraphs of a distance graph ⋮ On the number of edges in induced subgraphs of a special distance graph ⋮ Independence numbers of random subgraphs of distance graphs ⋮ A new estimate for the number of edges in induced subgraphs of a special distance graph ⋮ Independence numbers and chromatic numbers of the random subgraphs of some distance graphs ⋮ On the number of edges in a uniform hypergraph with a range of permitted intersections ⋮ Diameters of random distance graphs ⋮ On the number of edges of a uniform hypergraph with a range of allowed intersections ⋮ Chromatic numbers of some distance graphs ⋮ Estimate of the number of edges in special subgraphs of a distance graph ⋮ Independence numbers of Johnson-type graphs ⋮ On the stability of some Erdős-Ko-Rado type results ⋮ On the chromatic numbers of small-dimensional Euclidean spaces ⋮ On threshold probability for the stability of independent sets in distance graphs ⋮ Chromatic numbers of Kneser-type graphs ⋮ Hamiltonian paths in distance graphs ⋮ On the chromatic number of random subgraphs of a certain distance graph ⋮ New upper bound for the chromatic number of a random subgraph of a distance graph ⋮ Independence numbers and chromatic numbers of some distance graphs

This page was built for publication: Coloring some finite sets in {R}^{n}