Highly connected coloured subgraphs via the regularity Lemma (Q1045023)

From MaRDI portal
Revision as of 13:36, 23 March 2024 by Daniel (talk | contribs) (‎Created claim: Wikidata QID (P12): Q124978147, #quickstatements; #temporary_batch_1711196317277)
scientific article
Language Label Description Also known as
English
Highly connected coloured subgraphs via the regularity Lemma
scientific article

    Statements

    Highly connected coloured subgraphs via the regularity Lemma (English)
    0 references
    0 references
    15 December 2009
    0 references
    regularity Lemma
    0 references
    graph Ramsey numbers
    0 references
    \(k\)-connected graphs
    0 references

    Identifiers