<i>K<sup>s</sup></i>-Free Graphs Without Large <i>K<sup>r</sup></i>-Free Subgraphs (Q4314152): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Graphs without large triangle free subgraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Turan's theorem for sparse graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Local constraints ensuring small representing sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimum number of elements of representing a set system of given rank / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Construction of Certain Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Local and global clique numbers / rank
 
Normal rank

Revision as of 09:27, 23 May 2024

scientific article; zbMATH DE number 690972
Language Label Description Also known as
English
<i>K<sup>s</sup></i>-Free Graphs Without Large <i>K<sup>r</sup></i>-Free Subgraphs
scientific article; zbMATH DE number 690972

    Statements

    <i>K<sup>s</sup></i>-Free Graphs Without Large <i>K<sup>r</sup></i>-Free Subgraphs (English)
    0 references
    9 April 1995
    0 references
    upper bound
    0 references
    Lovász Local Lemma
    0 references
    exponential correlation inequality
    0 references

    Identifiers