The minimum number of clique-saturating edges (Q2680567): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / arXiv ID
 
Property / arXiv ID: 2201.03983 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph bootstrap percolation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear algebra and bootstrap percolation / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the number of \(K_4\)-saturating edges / rank
 
Normal rank
Property / cites work
 
Property / cites work: A survey of minimum saturated graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3360860 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Problem in Graph Theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: The History of Degenerate (Bipartite) Extremal Graph Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5133648 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5620621 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5790850 / rank
 
Normal rank

Latest revision as of 05:12, 31 July 2024

scientific article
Language Label Description Also known as
English
The minimum number of clique-saturating edges
scientific article

    Statements

    The minimum number of clique-saturating edges (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    4 January 2023
    0 references
    \(K_p\)-saturating
    0 references
    Turán graph
    0 references
    extremal graph
    0 references

    Identifiers