On the realization of subgraphs of a random graph by diameter graphs in Euclidean spaces
type: Item
instance of: scholarly article
title: On the realization of subgraphs of a random graph by diameter graphs in Euclidean spaces
zbMATH Open document ID: 1322.05124
DOI: 10.1134/S0001434615050065
author: A. A. Kokotkin
author: Andrei M. Raigorodskii
published in: Mathematical Notes
publication date: 2015-10-14T00:00:00Z
Mathematics Subject Classification ID: 05C80
Mathematics Subject Classification ID: 05C12
Mathematics Subject Classification ID: 05C15
Mathematics Subject Classification ID: 05C69
Mathematics Subject Classification ID: 05C35
zbMATH DE Number: 6494165
zbMATH Keywords: random graph
zbMATH Keywords: diameter graph
zbMATH Keywords: Euclidean space
zbMATH Keywords: Borsuk problem
zbMATH Keywords: chromatic number
zbMATH Keywords: independence number
MaRDI profile type: Publication
cites work: Drei Sätze über die n-dimensionale euklidische Sphäre
cites work: On the dimension in Borsuk's problem
cites work: On a bound in Borsuk's problem
cites work: Borsuk's problem and the chromatic numbers of some metric spaces
cites work: Counterexamples to Borsuk's conjecture on spheres of small radius
cites work: Coloring Distance Graphs and Graphs of Diameters
cites work: On the chromatic numbers of spheres in \(\mathbb R^n\)
cites work: Excursions into combinatorial geometry
cites work: 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
cites work: Random graphs.
cites work: The Nelson-Erdős-Hadwiger problem and a space realization of a random graph
cites work: On embedding of finite distance graphs with large chromatic number in random graphs
cites work: On the realization of random graphs as distance graphs in spaces of fixed dimension
cites work: New bounds for the distance Ramsey number
cites work: The two possible values of the chromatic number of a random graph
cites work: On a packing and covering problem
cites work: The probabilistic method. With an appendix on the life and work of Paul Erdős.
cites work: On the asymptotic structure of sparse triangle free graphs
cites work: On the difference between asymptotically good packings and coverings
description: scientific article; zbMATH DE number 6494165