Local resilience of spanning subgraphs in sparse random graphs (Q322312): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Local resilience of almost spanning trees in random graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Corrádi and Hajnal's Theorem for Sparse Random Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Almost spanning subgraphs of random graphs after adversarial edge removal / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bandwidth, expansion, treewidth, separators and universality for bounded-degree graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Proof of the bandwidth conjecture of Bollobás and Komlós / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the resilience of long cycles in random graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some Theorems on Abstract Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bandwidth theorem for random graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Embedding large subgraphs into dense graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dirac's theorem for random graphs / rank
 
Normal rank

Revision as of 17:26, 12 July 2024

scientific article
Language Label Description Also known as
English
Local resilience of spanning subgraphs in sparse random graphs
scientific article

    Statements

    Identifiers