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

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Eulerian and Hamiltonian graphs (05C45)

Related Items (69)

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

This page was built for publication: Embedding large subgraphs into dense graphs