Minimum H-decompositions of graphs: edge-critical case

DOI10.1016/J.JCTB.2011.10.004MaRDI QIDQ414645zbMATH OpenOpenAlexFDO

Authors Lale Özkahya, Yury Person

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

Edge-criticalGraph decompositionStability approachTurán graph

Mathematics Subject Classification ID

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

Recommendations

• An improved error term for minimum H-decompositions of graphs
• Minimum \(H\)-decompositions of graphs
• Decompositions of graphs into fans and single edges
• Decomposition of graphs into cycles of length seven and single edges.
• Decomposition of graphs into \((k,r)\)-fans and single edges

Cites work

• scientific article; zbMATH DE number 6093217 (Why is no real title available?)
• scientific article; zbMATH DE number 3641497 (Why is no real title available?)
• scientific article; zbMATH DE number 3258858 (Why is no real title available?)
• scientific article; zbMATH DE number 3262986 (Why is no real title available?)
• A Measure of Asymptotic Efficiency for Tests of a Hypothesis Based on the sum of Observations
• Asymptotic behavior of the chromatic index for hypergraphs
• Decomposition of graphs into cycles of length seven and single edges.
• Decompositions of graphs into 5-cycles and other small graphs
• Minimum \(H\)-decompositions of graphs
• On complete subgraphs of different orders
• On the structure of linear graphs
• The Representation of a Graph by Set Intersections

Cited in

(16)

• Turán function and \(H\)-decomposition problem for gem graphs
• Monochromatic \(K_{r}\)-decompositions of graphs
• Decompositions of graphs into fans and single edges
• Turán number and decomposition number of intersecting odd cycles
• Minimum \(H\)-decompositions of graphs
• Decomposition of graphs into \((k,r)\)-fans and single edges
• Minimum rainbow \(H\)-decompositions of graphs
• Minimum rainbow \(H\)-decompositions of graphs
• A Note on the Minimum H-Subgraph Edge Deletion
• An improved error term for minimum \(H\)-decompositions of graphs
• Decomposing uniform hypergraphs into uniform hypertrees and single edges
• scientific article; zbMATH DE number 568854 (Why is no real title available?)
• -MINIMUM SPANNING LENGTHS AND AN EXTENSION TO BURNSIDE’S THEOREM ON IRREDUCIBILITY
• Monochromatic clique decompositions of graphs
• Problems and invariants connected with bicliques and multicliques of graphs
• Graphs with large maximum degree containing no edge-critical graphs

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q414645)