Author:
Allen Peter,Böttcher Julia,Ehrenmüller Julia,Taraz Anusch
Subject
Applied Mathematics,Discrete Mathematics and Combinatorics
Reference12 articles.
1. P. Allen, J. Böttcher, H. Hàn, Y. Kohayakawa, Y. Person, Blow-up lemmas for sparse graphs, In preparation.
2. Local resilience of almost spanning trees in random graphs;Balogh;Random Structures & Algorithms,2011
3. Corrádi and Hajnal's theorem for sparse random graphs;Balogh;Combinatorics, Probability and Computing,2012
4. Almost spanning subgraphs of random graphs after adversarial edge removal;Böttcher;Combinatorics, Probability and Computing,2013
5. Bandwidth, expansion, treewidth, separators and universality for bounded-degree graphs;Böttcher;European Journal of Combinatorics,2010
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. On Komlós’ tiling theorem in random graphs;Combinatorics, Probability and Computing;2019-07-25
2. Spanning universality in random graphs;Random Structures & Algorithms;2018-10-18