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

DOI10.1134/S1064562414030296zbMATH Open1305.05210OpenAlexW2067577095MaRDI QIDQ471395FDOQ471395

Authors: 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

Recommendations

• On the realization of subgraphs of a random graph by diameter graphs in Euclidean spaces
• The Nelson-Erdős-Hadwiger problem and a space realization of a random graph
• The chromatic number of random Borsuk graphs
• On the realization of random graphs as distance graphs in spaces of fixed dimension
• The Nelson-Erdős-Hadwiger problem and embeddings of random graphs into geometric ones

zbMATH Keywords

random graphgraph of diameters: Borsuk conjecture

Mathematics Subject Classification ID

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

Cites Work

• Excursions into combinatorial geometry
• Random graphs.
• Coloring distance graphs and graphs of diameters
• On the chromatic numbers of spheres in \(\mathbb R^n\)
• On a bound in Borsuk's problem
• 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
• On the realization of random graphs as distance graphs in spaces of fixed dimension
• Drei Sätze über die n-dimensionale euklidische Sphäre
• New bounds for the distance Ramsey number
• Counterexamples to Borsuk's conjecture on spheres of small radius

Cited In (1)

• On the realization of subgraphs of a random graph by diameter graphs in Euclidean spaces

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q471395)