Almost Spanning Subgraphs of Random Graphs After Adversarial Edge Removal

[1]  Yoshiharu Kohayakawa,et al.  Small subsets inherit sparse epsilon-regularity , 2007, J. Comb. Theory, Ser. B.

[2]  Y. Kohayakawa.  Szemerédi's regularity lemma for sparse graphs , 1997 .

[3]  M. Schacht,et al.  Proof of the bandwidth conjecture of Bollobás and Komlós , 2009 .

[4]  Wojciech Samotij,et al.  Local resilience of almost spanning trees in random graphs , 2011, Random Struct. Algorithms.

[5]  Yoshiharu Kohayakawa,et al.  Szemerédi’s Regularity Lemma and Quasi-randomness , 2003 .

[6]  Carsten Thomassen,et al.  Path and cycle sub-ramsey numbers and an edge-colouring conjecture , 1986, Discret. Math..

[7]  Noga Alon,et al.  Embedding nearly-spanning bounded degree trees , 2007, Comb..

[8]  Domingos Dellamonica,et al.  Universality of random graphs , 2008, SODA '08.

[9]  Svante Janson,et al.  Random graphs , 2000, Wiley-Interscience series in discrete mathematics and optimization.

[10]  Yoshiharu Kohayakawa,et al.  Sparse partition universal graphs for graphs of bounded degree , 2011 .

[11]  Julia Böttcher,et al.  Bandwidth, expansion, treewidth, separators and universality for bounded-degree graphs , 2009, Eur. J. Comb..

[12]  Yoshiharu Kohayakawa,et al.  Almost Spanning Subgraphs of Random Graphs After Adversarial Edge Removal , 2009, Combinatorics, Probability and Computing.

[13]  Hao Huang,et al.  Bandwidth theorem for random graphs , 2012, J. Comb. Theory, Ser. B.

[14]  G. Dirac.  Some Theorems on Abstract Graphs , 1952 .

[15]  Wojciech Samotij,et al.  Corrádi and Hajnal's Theorem for Sparse Random Graphs , 2012, Combinatorics, Probability and Computing.

[16]  Alan M. Frieze,et al.  Polychromatic Hamilton cycles , 1993, Discret. Math..

[17]  Yoshiharu Kohayakawa,et al.  Properly coloured copies and rainbow copies of large graphs with small maximum degree , 2010, Random Struct. Algorithms.

[18]  Yoshiharu Kohayakawa,et al.  Regular pairs in sparse random graphs I , 2003, Random Struct. Algorithms.

[19]  Vojtech Rödl,et al.  Hypergraph Packing and Graph Embedding , 1999, Combinatorics, Probability and Computing.

[20]  Noga Alon,et al.  Optimal universal graphs with deterministic embedding , 2008, SODA '08.

[21]  Christian Krattenthaler,et al.  Bijective proofs of the hook formulas for the number of standard Young tableaux, ordinary and shifted , 1995, Electron. J. Comb..

[22]  Yoshiharu Kohayakawa,et al.  Universality and tolerance , 2000, Proceedings 41st Annual Symposium on Foundations of Computer Science.