Diameters of random distance graphs
From MaRDI portal
Publication:1687985
DOI10.1007/s10958-017-3594-yzbMath1410.05181OpenAlexW2766487022MaRDI QIDQ1687985
Publication date: 4 January 2018
Published in: Journal of Mathematical Sciences (New York) (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10958-017-3594-y
Related Items (1)
Cites Work
- On the chromatic numbers of spheres in \(\mathbb R^n\)
- Independence numbers and chromatic numbers of random subgraphs in some sequences of graphs
- On the chromatic numbers of spheres in Euclidean spaces
- On the stability of the Erdős-Ko-Rado theorem
- Distance graphs with large chromatic numbers and small clique numbers
- Codes with forbidden distances
- Around Borsuk's hypothesis
- Excursions into combinatorial geometry
- Borsuk's problem and the chromatic numbers of some metric spaces
- Coloring Distance Graphs and Graphs of Diameters
- Coloring some finite sets in {R}^{n}
- Independence numbers and chromatic numbers of the random subgraphs of some distance graphs
- The Mathematical Coloring Book
- Random graphs: models and asymptotic characteristics
- On the Ramsey numbers for complete distance graphs with vertices in $ \{0,1\}^n$
- Using the Borsuk-Ulam theorem. Lectures on topological methods in combinatorics and geometry. Written in cooperation with Anders Björner and Günter M. Ziegler
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Diameters of random distance graphs
