Minimum \(H\)-decompositions of graphs

DOI10.1016/j.jctb.2007.03.002zbMath1125.05085OpenAlexW2156786176MaRDI QIDQ2384810

Teresa Sousa, Oleg Pikhurko

Publication date: 10 October 2007

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jctb.2007.03.002

zbMATH Keywords

regularity lemmaTurán graphgraph decompositiongraph packing

Mathematics Subject Classification ID

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

Related Items (13)

Turán function and \(H\)-decomposition problem for gem graphs ⋮ Monochromatic Clique Decompositions of Graphs ⋮ Unnamed Item ⋮ Turán number and decomposition number of intersecting odd cycles ⋮ Minimum \(H\)-decompositions of graphs: edge-critical case ⋮ Decomposition of Graphs into (k,r)‐Fans and Single Edges ⋮ \(H\)-decomposition of \(r\)-graphs when \(H\) is an \(r\)-graph with exactly \(k\) independent edges ⋮ Monochromatic K_r‐Decompositions of Graphs ⋮ Minimum rainbow \(H\)-decompositions of graphs ⋮ Minimum rainbow \(H\)-decompositions of graphs ⋮ Decomposing uniform hypergraphs into uniform hypertrees and single edges ⋮ An improved error term for minimum \(H\)-decompositions of graphs ⋮ Decompositions of Graphs into Fans and Single Edges

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Asymptotic behavior of the chromatic index for hypergraphs
• Integer and fractional packings in dense graphs
• On a packing and covering problem
• Lower bounds of tower type for Szemerédi's uniformity lemma
• A note on a theorem of Erdős and Gallai
• \(H\)-factors in dense graphs
• Decompositions of graphs into 5-cycles and other small graphs
• Szemerédi's partition and quasirandomness
• On complete subgraphs of different orders
• The Algorithmic Aspects of the Regularity Lemma
• Graph Decomposition is NP-Complete: A Complete Proof of Holyer's Conjecture
• Proof of a tiling conjecture of Komlós
• Integer and fractional packing of families of graphs
• The Representation of a Graph by Set Intersections
• A Measure of Asymptotic Efficiency for Tests of a Hypothesis Based on the sum of Observations
• On a problem of K. Zarankiewicz
• Proof of the Alon-Yuster conjecture

This page was built for publication: Minimum \(H\)-decompositions of graphs