On the realization of subgraphs of a random graph by diameter graphs in Euclidean spaces (Q745606): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 2 users not shown)
Property / author
 
Property / author: Andrei M. Raigorodskii / rank
Normal rank
 
Property / author
 
Property / author: Andrei M. Raigorodskii / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Drei Sätze über die n-dimensionale euklidische Sphäre / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the dimension in Borsuk's problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: On a bound in Borsuk's problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Borsuk's problem and the chromatic numbers of some metric spaces / rank
 
Normal rank
Property / cites work
 
Property / cites work: Counterexamples to Borsuk's conjecture on spheres of small radius / rank
 
Normal rank
Property / cites work
 
Property / cites work: Coloring Distance Graphs and Graphs of Diameters / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the chromatic numbers of spheres in \(\mathbb R^n\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Excursions into combinatorial geometry / rank
 
Normal rank
Property / cites work
 
Property / 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 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2743189 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Nelson-Erdős-Hadwiger problem and a space realization of a random graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: On embedding of finite distance graphs with large chromatic number in random graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the realization of random graphs as distance graphs in spaces of fixed dimension / rank
 
Normal rank
Property / cites work
 
Property / cites work: New bounds for the distance Ramsey number / rank
 
Normal rank
Property / cites work
 
Property / cites work: The two possible values of the chromatic number of a random graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: On a packing and covering problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2784326 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the asymptotic structure of sparse triangle free graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the difference between asymptotically good packings and coverings / rank
 
Normal rank

Latest revision as of 22:14, 10 July 2024

scientific article
Language Label Description Also known as
English
On the realization of subgraphs of a random graph by diameter graphs in Euclidean spaces
scientific article

    Statements

    On the realization of subgraphs of a random graph by diameter graphs in Euclidean spaces (English)
    0 references
    0 references
    0 references
    14 October 2015
    0 references
    random graph
    0 references
    diameter graph
    0 references
    Euclidean space
    0 references
    Borsuk problem
    0 references
    chromatic number
    0 references
    independence number
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references