Coloring some finite sets in R^n

DOI10.7151/DMGT.1641MaRDI QIDQ2866446zbMATHOpenAlexFDO

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

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

chromatic numberindependence numberdistance graph

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Recommendations

• Coloring \({\mathbb R}^n\)
• Coloring finite subsets of uncountable sets
• scientific article; zbMATH DE number 1533526
• On the discrepancy of coloring finite sets
• Colorings of the space \(\mathbb R^{n}\) with several forbidden distances
• On the colouring of spheres embedded in \(\mathbb R^n\)
• scientific article; zbMATH DE number 866033
• Non-repetitive colorings of infinite sets
• On the finiteness of some \(n\)-color Rado numbers

Cited in

(25)

• On threshold probability for the stability of independent sets in distance graphs
• Independence numbers of random subgraphs of distance graphs
• On chromatic numbers of close-to-Kneser distance graphs
• Coloring Euclidean spaces so that all translates of a given set are rainbow
• New upper bound for the chromatic number of a random subgraph of a distance graph
• Independence numbers of Johnson-type graphs
• Coloring finite subsets of uncountable sets
• Coloring lines and Delaunay graphs with respect to boxes
• scientific article; zbMATH DE number 798646 (Why is no real title available?)
• On the chromatic number of random subgraphs of a certain distance graph
• On the number of edges in a uniform hypergraph with a range of permitted intersections
• The non-crossing graph
• Independence numbers and chromatic numbers of the random subgraphs of some distance graphs
• Hamiltonian paths in distance graphs
• Chromatic numbers of some distance graphs
• Estimate of the number of edges in special subgraphs of a distance graph
• Coloring the \(n\)-smooth numbers with \(n\) colors
• Chromatic numbers of Kneser-type graphs
• Diameters of random distance graphs
• On the number of edges in induced subgraphs of a special distance graph
• A new estimate for the number of edges in induced subgraphs of a special distance graph
• On the stability of some Erdős-Ko-Rado type results
• Independence numbers and chromatic numbers of some distance graphs
• Independence numbers of random subgraphs of a distance graph
• On the number of edges of a uniform hypergraph with a range of allowed intersections

This page was built for publication: Coloring some finite sets in \(\mathbb R^n\)

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2866446)