Sparse halves in dense triangle-free graphs (Q490981): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: On the connection between chromatic number, maximal clique and minimal degree of a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Triangle-Free Graphs with Large Degree / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4101818 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some old and new problems in various branches of combinatorics / rank
 
Normal rank
Property / cites work
 
Property / cites work: A local density condition for triangles / rank
 
Normal rank
Property / cites work
 
Property / cites work: ODD Cycles of Specified Length in Non-Bipartite Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Triangle-free four-chromatic graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sparse halves in triangle-free graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the edge distribution in triangle-free graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Subgraph densities in signed graphons and the local Simonovits-Sidorenko conjecture / rank
 
Normal rank
Property / cites work
 
Property / cites work: Testing properties of graphs and functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Caccetta-Häggkvist Conjecture with Forbidden Subgraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Turán's \((3,4)\)-problem with forbidden subgraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The binding number of a graph and its Anderson number / rank
 
Normal rank

Latest revision as of 16:00, 10 July 2024

scientific article
Language Label Description Also known as
English
Sparse halves in dense triangle-free graphs
scientific article

    Statements

    Sparse halves in dense triangle-free graphs (English)
    0 references
    0 references
    0 references
    21 August 2015
    0 references
    triangle-free graph
    0 references
    sparse half
    0 references
    minimum degree
    0 references
    Petersen graph
    0 references
    edit distance
    0 references
    blowup
    0 references

    Identifiers