Bandwidth theorem for random graphs (Q765187): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
Importer (talk | contribs)
Changed an Item
 
(5 intermediate revisions by 4 users not shown)
Property / author
 
Property / author: Benjamin Sudakov / rank
Normal rank
 
Property / author
 
Property / author: Benjamin Sudakov / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1995457760 / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q105583658 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1005.1947 / rank
 
Normal rank

Latest revision as of 17:44, 18 April 2024

scientific article
Language Label Description Also known as
English
Bandwidth theorem for random graphs
scientific article

    Statements

    Bandwidth theorem for random graphs (English)
    0 references
    0 references
    0 references
    0 references
    19 March 2012
    0 references
    0 references
    0 references
    0 references
    0 references
    random graphs
    0 references
    resilience
    0 references
    \(H\)-packings
    0 references
    0 references
    0 references
    0 references