Embedding large subgraphs into dense graphs

zbMath1182.05098arXiv0901.3541MaRDI QIDQ3656239

Publication date: 13 January 2010

Full work available at URL: https://arxiv.org/abs/0901.3541

05C70: Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.)

05C45: Eulerian and Hamiltonian graphs

Related Items

A blow-up lemma for approximate decompositions, On Perfect Matchings and Tilings in Uniform Hypergraphs, Matching of Given Sizes in Hypergraphs, Codegree Conditions for Tiling Complete k-Partite k-Graphs and Loose Cycles, On Komlós’ tiling theorem in random graphs, Spanning Trees with Few Branch Vertices, An Extension of the Blow-up Lemma to Arrangeable Graphs, The Approximate Loebl--Komlós--Sós Conjecture I: The Sparse Decomposition, The Approximate Loebl--Komlós--Sós Conjecture II: The Rough Structure of LKS Graphs, An Asymptotic Multipartite Kühn--Osthus Theorem, Minimum Codegree Threshold forC₆³-Factors in 3-Uniform Hypergraphs, Exact Minimum Codegree Threshold for K⁻₄-Factors, A geometric theory for hypergraph matching, Transversal factors and spanning trees, The approximate Loebl-Komlós-Sós conjecture and embedding trees in sparse graphs, A degree sequence Hajnal-Szemerédi theorem, Local resilience of spanning subgraphs in sparse random graphs, Monochromatic cycle partitions of graphs with large minimum degree, The extremal function for partial bipartite tilings, Large matchings in uniform hypergraphs and the conjectures of Erdős and samuels, Hamilton cycles in dense vertex-transitive graphs, On the KŁR conjecture in random graphs, Minimum vertex degree thresholds for tiling complete 3-partite 3-graphs, Forbidding Hamilton cycles in uniform hypergraphs, Perfect matchings (and Hamilton cycles) in hypergraphs with large degrees, An approximate version of Sumner's universal tournament conjecture, Bandwidth theorem for random graphs, Loebl-Komlós-Sós conjecture: dense case, A note on perfect matchings in uniform hypergraphs, Cycles of given length in oriented graphs, Hamiltonian degree sequences in digraphs, Bandwidth, expansion, treewidth, separators and universality for bounded-degree graphs, Triangle packings and 1-factors in oriented graphs, Some Ore-type results for matching and perfect matching in $k$-uniform hypergraphs, Vertex degree sums for perfect matchings in 3-uniform hypergraphs, $d$-matching in 3-uniform hypergraphs, Tiling tripartite graphs with 3-colorable graphs: the extreme case, On multipartite Hajnal-Szemerédi theorems, Matching in 3-uniform hypergraphs, Spanning trees of dense directed graphs, Long monochromatic paths and cycles in 2-colored bipartite graphs, Codegree threshold for tiling balanced complete $3$-partite $3$-graphs and generalized $4$-cycles, The complexity of perfect matchings and packings in dense hypergraphs, Rainbow factors in hypergraphs, Degree versions of theorems on intersecting families via stability, $F$-factors in hypergraphs via absorption, A multipartite Hajnal-Szemerédi theorem, Hamilton decompositions of regular expanders: applications, Fractional and integer matchings in uniform hypergraphs, Triangle resilience of the square of a Hamilton cycle in random graphs, On factors of independent transversals in $k$-partite graphs, Spanning trees in dense directed graphs, Unnamed Item, Unnamed Item, Spanning embeddings of arrangeable graphs with sublinear bandwidth, Permanents of multidimensional matrices: Properties and applications, A hypergraph blow-up lemma, TILING DIRECTED GRAPHS WITH TOURNAMENTS, Perfect Matchings in Hypergraphs and the Erdös Matching Conjecture, Near Perfect Matchings in ${k}$-Uniform Hypergraphs II, Embedding Graphs into Larger Graphs: Results, Methods, and Problems