Proof of the Alon-Yuster conjecture
From MaRDI portal
Publication:5937938
DOI10.1016/S0012-365X(00)00279-XzbMath0977.05106OpenAlexW2030651378WikidataQ105962009 ScholiaQ105962009MaRDI QIDQ5937938
Gábor N. Sárközy, János Komlós, Endre Szemerédi
Publication date: 23 October 2001
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0012-365x(00)00279-x
Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Coloring of graphs and hypergraphs (05C15)
Related Items
An Asymptotic Multipartite Kühn--Osthus Theorem ⋮ Corrádi and Hajnal's Theorem for Sparse Random Graphs ⋮ Perfect packings in quasirandom hypergraphs. I. ⋮ Minimum degree thresholds for bipartite graph tiling ⋮ Tilings in vertex ordered graphs ⋮ K4−‐factor in a graph ⋮ Dirac-type results for tilings and coverings in ordered graphs ⋮ Cycles of Given Size in a Dense Graph ⋮ Bandwidth, treewidth, separators, expansion, and universality ⋮ The minimum degree threshold for perfect graph packings ⋮ Minimum \(H\)-decompositions of graphs ⋮ Loose Hamilton cycles in 3-uniform hypergraphs of high minimum degree ⋮ Asymptotic multipartite version of the Alon-Yuster theorem ⋮ Triangle resilience of the square of a Hamilton cycle in random graphs ⋮ 2-universality in randomly perturbed graphs ⋮ Proof of the Erdős-Faudree conjecture on quadrilaterals ⋮ On resilience of connectivity in the evolution of random graphs ⋮ Embedding clique-factors in graphs with low \(\ell\)-independence number ⋮ Graph Tilings in Incompatibility Systems ⋮ Rainbow spanning structures in graph and hypergraph systems ⋮ Packing \(k\)-partite \(k\)-uniform hypergraphs ⋮ Triangle factors of graphs without large independent sets and of weighted graphs ⋮ Factors in randomly perturbed hypergraphs ⋮ Codegree threshold for tiling balanced complete \(3\)-partite \(3\)-graphs and generalized \(4\)-cycles ⋮ A degree sequence version of the Kühn-Osthus tiling theorem ⋮ Minimum number of edges guaranteeing the existence of a \(K_{1, t}\)-factor in a graph ⋮ On multipartite Hajnal-Szemerédi theorems ⋮ Perfect Packings in Quasirandom Hypergraphs II ⋮ Minimum Codegree Threshold forC63-Factors in 3-Uniform Hypergraphs ⋮ Degree conditions for the existence of vertex-disjoint cycles and paths: a survey ⋮ Minimum degree conditions for vertex-disjoint even cycles in large graphs ⋮ A rainbow blow‐up lemma ⋮ Combinatorial and computational aspects of graph packing and graph decomposition ⋮ On a tiling conjecture of Komlós for 3-chromatic graphs. ⋮ A rainbow blow-up lemma for almost optimally bounded edge-colourings ⋮ The Complexity of Perfect Packings in Dense Graphs ⋮ On the KŁR conjecture in random graphs ⋮ Embedding Graphs into Larger Graphs: Results, Methods, and Problems ⋮ Spanning 3-colourable subgraphs of small bandwidth in dense graphs ⋮ A blow-up lemma for approximate decompositions ⋮ Covering and tiling hypergraphs with tight cycles ⋮ Perfect packings with complete graphs minus an edge ⋮ On embedding well-separable graphs ⋮ Embedding Spanning Bipartite Graphs of Small Bandwidth ⋮ On 2-factors with \(k\) components ⋮ Minimum vertex degree thresholds for tiling complete 3-partite 3-graphs ⋮ Proof of the bandwidth conjecture of Bollobás and Komlós ⋮ Tiling tripartite graphs with 3-colorable graphs: the extreme case ⋮ A common extension of the Erdős-Stone theorem and the Alon-Yuster theorem for unbounded graphs ⋮ Unnamed Item ⋮ The complexity of perfect matchings and packings in dense hypergraphs ⋮ Star-factors in graphs with large minimum degree ⋮ \(K_{1,3}\)-factors in graphs ⋮ Distributing vertices along a Hamiltonian cycle in Dirac graphs ⋮ Proof of a tiling conjecture of Komlós ⋮ On a Ramsey--Turán Variant of the Hajnal--Szemerédi Theorem ⋮ Rainbow factors in hypergraphs ⋮ Triangle‐factors in pseudorandom graphs ⋮ Tilings in Randomly Perturbed Dense Graphs ⋮ Codegree Conditions for Tiling Complete k-Partite k-Graphs and Loose Cycles ⋮ On the Chromatic Number of Matching Kneser Graphs ⋮ On Komlós’ tiling theorem in random graphs ⋮ A fast parallel algorithm for finding Hamiltonian cycles in dense graphs ⋮ A hypergraph blow-up lemma ⋮ Triangle packings and 1-factors in oriented graphs ⋮ Bandwidth theorem for random graphs ⋮ On 2-factors with cycles containing specified vertices in a bipartite graph ⋮ A Degree Sequence Komlós Theorem ⋮ A discrepancy version of the Hajnal–Szemerédi theorem ⋮ TILING DIRECTED GRAPHS WITH TOURNAMENTS ⋮ An Extension of the Blow-up Lemma to Arrangeable Graphs ⋮ Minimum Vertex Degree Threshold for ‐tiling* ⋮ Almost-spanning subgraphs with bounded degree in dense graphs ⋮ A degree sequence Hajnal-Szemerédi theorem
