The number of triangles in a \(K_ 4\)-free graph (Q1112062): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
Set OpenAlex properties.
 
(4 intermediate revisions by 3 users not shown)
Property / reviewed by
 
Property / reviewed by: John W. Moon / rank
Normal rank
 
Property / reviewed by
 
Property / reviewed by: John W. Moon / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3852212 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5724802 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5721211 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3936767 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Triangles in an Ordinary Graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the theory of graphs / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/0012-365x(88)90021-0 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2079412785 / rank
 
Normal rank

Latest revision as of 11:12, 30 July 2024

scientific article
Language Label Description Also known as
English
The number of triangles in a \(K_ 4\)-free graph
scientific article

    Statements

    The number of triangles in a \(K_ 4\)-free graph (English)
    0 references
    0 references
    1988
    0 references
    The author shows that if a graph with e edges contains no complete 4- graphs then it contains at most \((e/3)^{3/2}\) complete 3-graphs.
    0 references
    complete 3-graphs
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers