Minimum \(H\)-decompositions of graphs: edge-critical case

DOI10.1016/j.jctb.2011.10.004zbMath1250.05089OpenAlexW2018719884MaRDI QIDQ414645

Yury Person, Lale Özkahya

Publication date: 11 May 2012

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.2011.10.004

zbMATH Keywords

Turán graphEdge-criticalGraph decompositionStability approach

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Related Items (12)

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 ⋮ Graphs with large maximum degree containing no edge-critical graphs ⋮ Decomposition of Graphs into (k,r)‐Fans and Single 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
• Unnamed Item
• Unnamed Item
• Asymptotic behavior of the chromatic index for hypergraphs
• Minimum \(H\)-decompositions of graphs
• Decompositions of graphs into 5-cycles and other small graphs
• On complete subgraphs of different orders
• 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 the structure of linear graphs

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