Bandwidth theorem for random graphs (Q765187)

From MaRDI portal
Revision as of 00:45, 5 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
Bandwidth theorem for random graphs
scientific article

    Statements

    title
    Bandwidth theorem for random graphs (English)
    0 references
    author
    Hao Huang
    0 references
    Choongbum Lee
    0 references
    Benjamin Sudakov
    0 references
    publication date
    19 March 2012
    0 references
    zbMATH Keywords
    random graphs
    0 references
    resilience
    0 references
    \(H\)-packings
    0 references
    cites work
    Q3503433
    0 references
    Q3803160
    0 references
    Q5315023
    0 references
    Q3416250
    0 references
    Q5620621
    0 references
    The Blow-up Lemma
    0 references
    Tiling Turán theorems
    0 references
    Q4878666
    0 references
    Blow-up lemma
    0 references
    Q5477817
    0 references
    Q4200109
    0 references

    Identifiers

    Mathematics Subject Classification ID
    05C80
    0 references
    05C78
    0 references
    05C35
    0 references
    zbMATH DE Number
    6015676
    0 references
    OpenAlex ID
    W1995457760
    0 references
    Wikidata QID
    Q105583658
    0 references
    arXiv ID
    1005.1947
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q765187&oldid=35269794"
    Powered by MediaWiki