Turán type results for distance graphs (Q331389): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Research Problems in Discrete Geometry / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Sets of Distances of n Points / rank
 
Normal rank
Property / cites work
 
Property / cites work: Independence, clique size and maximum degree / rank
 
Normal rank
Property / cites work
 
Property / cites work: 11/30 (Finding large independent sets in connected triangle-free 3- regular graphs) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding Independent Sets in Triangle-Free Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lower bounds on size and independence inK4-free graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On large subgraphs of a distance graph which have small chromatic number / rank
 
Normal rank
Property / cites work
 
Property / cites work: The realization of distances within sets in Euclidean space / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding independent sets in \(K_4\)-free 4-regular connected graphs / 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: Q3464534 / rank
 
Normal rank

Latest revision as of 20:18, 12 July 2024

scientific article
Language Label Description Also known as
English
Turán type results for distance graphs
scientific article

    Statements

    Turán type results for distance graphs (English)
    0 references
    0 references
    0 references
    27 October 2016
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    Turán theorem
    0 references
    independence number
    0 references
    distance graphs
    0 references
    0 references