\(H\)-factors in dense graphs
From MaRDI portal
Publication:1924126
DOI10.1006/JCTB.1996.0020zbMath0855.05085OpenAlexW2005223884MaRDI QIDQ1924126
Publication date: 12 January 1997
Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1006/jctb.1996.0020
Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph algorithms (graph-theoretic aspects) (05C85)
Related Items (75)
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 ⋮ The minimum degree threshold for perfect graph packings ⋮ Minimum \(H\)-decompositions of graphs ⋮ A Degree Sequence Strengthening of the Vertex Degree Threshold for a Perfect Matching in 3-Uniform Hypergraphs ⋮ 2-factors in dense graphs ⋮ Vertex disjoint copies of \(K_{1 , 4}\) in claw-free graphs ⋮ Asymptotic multipartite version of the Alon-Yuster theorem ⋮ A greedy algorithm for the social golfer and the Oberwolfach problem ⋮ Embedding clique-factors in graphs with low \(\ell\)-independence number ⋮ Graph Tilings in Incompatibility Systems ⋮ Packing \(k\)-partite \(k\)-uniform hypergraphs ⋮ High powers of Hamiltonian cycles in randomly augmented graphs ⋮ Clique-factors in graphs with sublinear -independence number ⋮ Sharpening an ore-type version of the Corrádi-Hajnal theorem ⋮ 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 ⋮ Vertex-disjoint cycles of the same length. ⋮ 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 ⋮ Combinatorial and computational aspects of graph packing and graph decomposition ⋮ On a tiling conjecture of Komlós for 3-chromatic graphs. ⋮ 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 ⋮ Edge-decompositions of graphs with high minimum degree ⋮ Covering and tiling hypergraphs with tight cycles ⋮ Perfect packings with complete graphs minus an edge ⋮ On embedding well-separable graphs ⋮ An Ore-type theorem on equitable coloring ⋮ On vertex-induced weighted Turán problems ⋮ Embedding Spanning Bipartite Graphs of Small Bandwidth ⋮ Disjoint triangles and quadrilaterals in a graph ⋮ Minimum vertex degree thresholds for tiling complete 3-partite 3-graphs ⋮ A refinement of a result of Corrádi and Hajnal ⋮ Covering a graph with cycles of length at least 4 ⋮ 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 ⋮ Vertex-disjoint quadrilaterals in graphs ⋮ Equitable versus nearly equitable coloring and the Chen-Lih-Wu Conjecture ⋮ The complexity of perfect matchings and packings in dense hypergraphs ⋮ Star-factors in graphs with large minimum degree ⋮ Proof of a tiling conjecture of Komlós ⋮ Ore-type versions of Brooks' theorem ⋮ On a Ramsey--Turán Variant of the Hajnal--Szemerédi Theorem ⋮ Triangle‐factors in pseudorandom graphs ⋮ Equitable Coloring of Graphs. Recent Theoretical Results and New Practical Algorithms ⋮ Codegree Conditions for Tiling Complete k-Partite k-Graphs and Loose Cycles ⋮ On Komlós’ tiling theorem in random graphs ⋮ 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 ⋮ Vertex-disjoint claws in graphs ⋮ Cycle factors in dense graphs ⋮ On quadrilaterals in a graph ⋮ Optimal factorizations of families of trees ⋮ 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
This page was built for publication: \(H\)-factors in dense graphs
