On extremal graphs without compatible triangles or quadrilaterals (Q1322244)

From MaRDI portal
Revision as of 02:56, 5 March 2024 by Import240304020342 (talk | contribs) (Set profile property.)
scientific article
Language Label Description Also known as
English
On extremal graphs without compatible triangles or quadrilaterals
scientific article

    Statements

    On extremal graphs without compatible triangles or quadrilaterals (English)
    0 references
    0 references
    28 August 1994
    0 references
    The paper is concerned with the following extremal problem in extremal graph theory: Given a graph \(H\), determine the maximal number of edges in a graph \(G\) on \(n\) vertices without a copy of \(H\).
    0 references
    triangles
    0 references
    quadrilaterals
    0 references
    extremal problem
    0 references
    extremal graph
    0 references

    Identifiers