Almost \(H\)-factors in dense graphs

DOI10.1007/BF02350627zbMath0769.05072OpenAlexW2062435485MaRDI QIDQ1196560

Raphael Yuster, Noga Alon

Publication date: 16 January 1993

Published in: Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf02350627

zbMATH Keywords

dense graphs\(H\)-factors

Mathematics Subject Classification ID

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

Related Items (20)

Corrádi and Hajnal's Theorem for Sparse Random Graphs ⋮ Blow-up lemma ⋮ 2-factors in dense graphs ⋮ Rainbow spanning structures in graph and hypergraph systems ⋮ On a tiling conjecture of Komlós for 3-chromatic graphs. ⋮ Spanning 3-colourable subgraphs of small bandwidth in dense graphs ⋮ On embedding well-separable graphs ⋮ An Ore-type theorem on equitable coloring ⋮ 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 ⋮ Equitable versus nearly equitable coloring and the Chen-Lih-Wu Conjecture ⋮ Star-factors in graphs with large minimum degree ⋮ Proof of a tiling conjecture of Komlós ⋮ Ore-type versions of Brooks' theorem ⋮ On Komlós’ tiling theorem in random graphs ⋮ Cycle factors in dense graphs ⋮ TILING DIRECTED GRAPHS WITH TOURNAMENTS ⋮ Almost-spanning subgraphs with bounded degree in dense graphs ⋮ A degree sequence Hajnal-Szemerédi theorem

Cites Work

• On the maximal number of independent circuits in a graph
• Unnamed Item

This page was built for publication: Almost \(H\)-factors in dense graphs