Bounds on the number of complete subgraphs (Q1195482): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Q3835498 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3852212 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the number of complete subgraphs and circuits contained in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The number of triangles in a \(K_ 4\)-free graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lower bounds on the number of triangles in a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3478424 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Triangles in an Ordinary Graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: A generalization of a theorem of Turán / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the theory of graphs / rank
 
Normal rank

Revision as of 13:40, 16 May 2024

scientific article
Language Label Description Also known as
English
Bounds on the number of complete subgraphs
scientific article

    Statements

    Bounds on the number of complete subgraphs (English)
    0 references
    0 references
    0 references
    6 December 1992
    0 references
    clique number
    0 references
    number of complete subgraphs
    0 references
    Turán's theorem
    0 references
    bound
    0 references

    Identifiers