Coloring some finite sets in R^n
From MaRDI portal
Publication:2866446
DOI10.7151/DMGT.1641zbMATH Open1296.05066OpenAlexW2072816749MaRDI QIDQ2866446FDOQ2866446
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
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 chromatic numbers of close-to-Kneser distance graphs
- On the stability of some Erdős-Ko-Rado type results
- Independence numbers and chromatic numbers of some distance graphs
- On the number of edges in a uniform hypergraph with a range of permitted intersections
- Coloring the \(n\)-smooth numbers with \(n\) colors
- Chromatic numbers of Kneser-type graphs
- On the number of edges of a uniform hypergraph with a range of allowed intersections
- On threshold probability for the stability of independent sets in distance graphs
- On the chromatic number of random subgraphs of a certain distance graph
- Diameters of random distance graphs
- Independence numbers of random subgraphs of a distance graph
- Independence numbers of random subgraphs of distance graphs
- New upper bound for the chromatic number of a random subgraph of a distance graph
- Hamiltonian paths in 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
- Coloring Euclidean spaces so that all translates of a given set are rainbow
- Coloring finite subsets of uncountable sets
- Title not available (Why is that?)
- On the chromatic numbers of small-dimensional Euclidean spaces
- Independence numbers and chromatic numbers of the random subgraphs of some distance graphs
- Independence numbers of Johnson-type graphs
- Estimate of the number of edges in special subgraphs of a distance graph
- The non-crossing graph
- Chromatic numbers of some distance graphs
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)
