New upper bound for the chromatic number of a random subgraph of a distance graph (Q2352580): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Research Problems in Discrete Geometry / rank
 
Normal rank
Property / cites work
 
Property / cites work: Coloring some finite sets in {R}^{n} / 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: Coloring Distance Graphs and Graphs of Diameters / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4339095 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The problems of Borsuk and Grunbaum on lattice polytopes / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Erdõs-Hadwiger problem and the chromatic numbers of finite geometric graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4410025 / 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: An improvement of the Frankl-Wilson theorem on the number of edges in a hypergraph with forbidden intersections of edges / rank
 
Normal rank
Property / cites work
 
Property / cites work: New estimates in the problem of the number of edges in a hypergraph with forbidden intersections / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Mathematical Coloring Book / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Borsuk problem for \((0,1)\)-polyhedra and cross polytopes. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Borsuk's problem for \((0,1)\)-polytopes and cross-polytopes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4002287 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The problem of Borsuk, Hadwiger,and Grünbaum for some classes of polytopes and graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Ramsey numbers for complete distance graphs with vertices in $ \{0,1\}^n$ / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4146667 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On a packing and covering problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Codes with forbidden distances / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3267900 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2743189 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2723297 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4519896 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Independence numbers and chromatic numbers of random subgraphs in some sequences of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On random subgraphs of Kneser and Schrijver graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the stability of the Erdős-Ko-Rado theorem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3781767 / rank
 
Normal rank
Property / cites work
 
Property / cites work: What we know and what we do not know about Turán numbers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5781249 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The chromatic number of random graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The chromatic number of random graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4063504 / rank
 
Normal rank

Latest revision as of 11:55, 10 July 2024

scientific article
Language Label Description Also known as
English
New upper bound for the chromatic number of a random subgraph of a distance graph
scientific article

    Statements

    New upper bound for the chromatic number of a random subgraph of a distance graph (English)
    0 references
    0 references
    3 July 2015
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    Hadwiger-Nelson problem
    0 references
    distance graph
    0 references
    random subgraph
    0 references
    chromatic number
    0 references
    Turán number
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references