Almost spanning subgraphs of random graphs after adversarial edge removal (Q2840559): Difference between revisions

From MaRDI portal
Merged Item from Q5397725
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Sparse universal graphs for bounded‐degree graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3579480 / 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: Q3579496 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some Theorems on Abstract Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Szemerédi’s Regularity Lemma for Sparse Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4407452 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sparse partition universal graphs for graphs of bounded degree / rank
 
Normal rank
Property / cites work
 
Property / cites work: Local resilience of graphs / rank
 
Normal rank

Revision as of 16:19, 6 July 2024

scientific article; zbMATH DE number 6261147
  • Almost Spanning Subgraphs of Random Graphs After Adversarial Edge Removal
Language Label Description Also known as
English
Almost spanning subgraphs of random graphs after adversarial edge removal
scientific article; zbMATH DE number 6261147
  • Almost Spanning Subgraphs of Random Graphs After Adversarial Edge Removal

Statements

Almost spanning subgraphs of random graphs after adversarial edge removal (English)
0 references
Almost Spanning Subgraphs of Random Graphs After Adversarial Edge Removal (English)
0 references
0 references
0 references
0 references
0 references
0 references
19 July 2013
0 references
24 February 2014
0 references
0 references
0 references
0 references
0 references
0 references
graph theory
0 references
extremal problems
0 references
random graphs
0 references
sparse regularity
0 references
almost spanning bipartite graphs
0 references
0 references
0 references
0 references