Extremal graphs for two vertex-disjoint copies of a clique (Q2117533): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: The Turàn number of the graph 3P4 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Turán number of the graph \(2P_5\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: On maximal paths and circuits of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On an extremal problem in graph theory. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Path Ramsey numbers in multicolorings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5620621 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3852213 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Extremal Numbers for Odd Cycles / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Independent Complete Subgraphs in a Graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5548826 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5781249 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A review of goodness of fit tests for Pareto distributions / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Turán number of disjoint copies of paths / rank
 
Normal rank
Property / cites work
 
Property / cites work: Turán numbers for disjoint paths / rank
 
Normal rank

Latest revision as of 09:20, 28 July 2024

scientific article
Language Label Description Also known as
English
Extremal graphs for two vertex-disjoint copies of a clique
scientific article

    Statements

    Extremal graphs for two vertex-disjoint copies of a clique (English)
    0 references
    0 references
    21 March 2022
    0 references
    clique
    0 references
    Hajnal and Szemerédi theorem
    0 references
    extremal graph
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references