Bounds for graph regularity and removal lemmas (Q1930904)

From MaRDI portal
Revision as of 02:54, 6 July 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Bounds for graph regularity and removal lemmas
scientific article

    Statements

    title
    Bounds for graph regularity and removal lemmas (English)
    0 references
    author
    David Conlon
    0 references
    Jacob Fox
    0 references
    publication date
    14 January 2013
    0 references
    zbMATH DE Number
    6125053
    0 references
    zbMATH Keywords
    Szemerédi's regularity lemma
    0 references
    weak regularity lemma of Frieze and Kannan
    0 references
    strong regularity lemma
    0 references
    regular approximation theorem
    0 references
    graph removal lemma
    0 references
    tower function
    0 references
    tower-type bound
    0 references
    weak partition
    0 references
    Wikidata QID
    Q56675393
    0 references
    OpenAlex ID
    W1691611448
    0 references
    arXiv ID
    1107.4829
    0 references
    cites work
    Q4059020
    0 references
    Q5501357
    0 references
    Quasi-random graphs
    0 references
    Q4407452
    0 references
    Q4878666
    0 references
    Q5477817
    0 references
    Holes in graphs
    0 references
    Q3060865
    0 references
    Q4175585
    0 references
    Q5692730
    0 references
    Q4401979
    0 references
    Q4101924
    0 references
    Q5480762
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q1930904&oldid=35317258"
    Powered by MediaWiki