On the realization of subgraphs of a random graph by diameter graphs in Euclidean spaces
From MaRDI portal
Publication:745606
DOI10.1134/S0001434615050065zbMath1322.05124MaRDI QIDQ745606
A. A. Kokotkin, Andrei M. Raigorodskii
Publication date: 14 October 2015
Published in: Mathematical Notes (Search for Journal in Brave)
Extremal problems in graph theory (05C35) Random graphs (graph-theoretic aspects) (05C80) Coloring of graphs and hypergraphs (05C15) Distance in graphs (05C12) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)
Cites Work
- Unnamed Item
- Unnamed Item
- New bounds for the distance Ramsey number
- On the chromatic numbers of spheres in \(\mathbb R^n\)
- Counterexamples to Borsuk's conjecture on spheres of small radius
- On embedding of finite distance graphs with large chromatic number in random graphs
- On a packing and covering problem
- On the difference between asymptotically good packings and coverings
- On the realization of random graphs as distance graphs in spaces of fixed dimension
- Excursions into combinatorial geometry
- Borsuk's problem and the chromatic numbers of some metric spaces
- Coloring Distance Graphs and Graphs of Diameters
- The Nelson-Erdős-Hadwiger problem and a space realization of a random graph
- On the dimension in Borsuk's problem
- On a bound in Borsuk's problem
- Drei Sätze über die n-dimensionale euklidische Sphäre
- On the asymptotic structure of sparse triangle free graphs
- 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
- The two possible values of the chromatic number of a random graph
This page was built for publication: On the realization of subgraphs of a random graph by diameter graphs in Euclidean spaces
