On the number of edges in induced subgraphs of a special distance graph (Q325666): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q3464534 / 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: Borsuk's problem and the chromatic numbers of some metric spaces / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the chromatic numbers of spheres in Euclidean spaces / 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: Coloring some finite sets in {R}^{n} / 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: Q4339095 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4410025 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Mathematical Coloring Book / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4002287 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Excursions into combinatorial geometry / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5301263 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Around Borsuk's hypothesis / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3997075 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4044599 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3893810 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Codes with forbidden distances / rank
 
Normal rank
Property / cites work
 
Property / cites work: Distance graphs with large chromatic numbers and small clique numbers / 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

Latest revision as of 17:44, 12 July 2024

scientific article
Language Label Description Also known as
English
On the number of edges in induced subgraphs of a special distance graph
scientific article

    Statements

    On the number of edges in induced subgraphs of a special distance graph (English)
    0 references
    0 references
    18 October 2016
    0 references
    distance graph
    0 references
    clique
    0 references
    cycle
    0 references
    coloring
    0 references
    Borsuk problem
    0 references

    Identifiers