An approximate blow-up lemma for sparse pseudorandom graphs☆
References (10)
- et al.
Bandwidth, expansion, treewidth, separators and universality for bounded-degree graphs
European J. Combin.
(2010) - et al.
Bandwidth theorem for random graphs
J. Combin. Theory Ser. B
(2012) Pseudorandom graphs
- et al.
Ramsey-goodness—and otherwise
Combinatorica
(2013) - et al.
Proof of the bandwidth conjecture of Bollobás and Komlós
Math. Ann.
(2009)
There are more references available in the full text version of this article.
Cited by (0)
- ☆
Partially supported by NUMEC/USP (Project MaCLinC/USP).
- 1
Supported by FAPESP (Proc. 2010/16526-3).
- 2
Partially supported by CNPq (308509/2007-2, 484154/2010-9).
Copyright © 2013 Elsevier B.V. All rights reserved.