Colorings of spaces, and random graphs
From MaRDI portal
Publication:950800
DOI10.1007/s10958-007-0388-7zbMath1146.05043OpenAlexW2049572200MaRDI QIDQ950800
Publication date: 28 October 2008
Published in: Journal of Mathematical Sciences (New York) (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10958-007-0388-7
Random graphs (graph-theoretic aspects) (05C80) Planar graphs; geometric and topological aspects of graph theory (05C10) Coloring of graphs and hypergraphs (05C15)
Cites Work
- A 15-colouring of 3-space omitting distance one
- On the space chromatic number
- Concentration of measure and isoperimetric inequalities in product spaces
- The Erdős-Hadwiger problem and the chromatic numbers of finite geometric graphs
- The Nelson-Erdős-Hadwiger problem and embeddings of random graphs into geometric ones
- Borsuk's problem and the chromatic numbers of some metric spaces
- On the chromatic number of a space
- New versions of Suen's correlation inequality
- The realization of distances within sets in Euclidean space
- The Erdõs-Hadwiger problem and the chromatic numbers of finite geometric graphs
- The chromatic number of random graphs
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Colorings of spaces, and random graphs