The algorithmic aspects of the regularity lemma
Journal of Algorithms
The square of paths and cycles
Journal of Combinatorial Theory Series B
Discrete Mathematics
Journal of Combinatorial Theory Series B
Journal of Combinatorial Theory Series B
On the square of a Hamiltonian cycle in dense graphs
Proceedings of the seventh international conference on Random structures and algorithms
An algorithmic version of the blow-up lemma
Random Structures & Algorithms
Proof of the Alon—Yuster conjecture
Discrete Mathematics
Matchings Meeting Quotas and Their Impact on the Blow-Up Lemma
SIAM Journal on Computing
2-factors in dense bipartite graphs
Discrete Mathematics - Kleitman and combinatorics: a celebration
Spanning Trees in Dense Graphs
Combinatorics, Probability and Computing
Combinatorics, Probability and Computing
Critical chromatic number and the complexity of perfect packings in graphs
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
Large planar subgraphs in dense graphs
Journal of Combinatorial Theory Series B
On the Pósa-Seymour conjecture
Journal of Graph Theory
Spanning triangulations in graphs
Journal of Graph Theory
Bandwidth theorem for random graphs
Journal of Combinatorial Theory Series B
Embedding into Bipartite Graphs
SIAM Journal on Discrete Mathematics
Hi-index | 0.00 |
A conjecture by Bollobas and Komlos states the following: For every@c0and integersr=2and @D, there exists@b0with the following property. If G is a sufficiently large graph with n vertices and minimum degree at least(r-1r+@c)nand H is an r-chromatic graph with n vertices, bandwidth at most @bn and maximum degree at most @D, then G contains a copy of H. This conjecture generalises several results concerning sufficient degree conditions for the containment of spanning subgraphs. We prove the conjecture for the case r=3.