Realization of subgraphs of random graphs by graphs of diameters in Euclidean spaces

DOI10.1134/S1064562414030296zbMath1305.05210OpenAlexW2067577095MaRDI QIDQ471395

A. A. Kokotkin

Publication date: 14 November 2014

Published in: Doklady Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1134/s1064562414030296

zbMATH Keywords

random graphgraph of diameters: Borsuk conjecture

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Coloring of graphs and hypergraphs (05C15) Distance in graphs (05C12)

Cites Work

• 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 the realization of random graphs as distance graphs in spaces of fixed dimension
• Excursions into combinatorial geometry
• Coloring Distance Graphs and Graphs of Diameters
• On a bound in Borsuk's problem
• Drei Sätze über die n-dimensionale euklidische Sphäre
• 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

This page was built for publication: Realization of subgraphs of random graphs by graphs of diameters in Euclidean spaces