Minimum H-decompositions of graphs: edge-critical case

DOI10.1016/J.JCTB.2011.10.004zbMATH Open1250.05089OpenAlexW2018719884MaRDI QIDQ414645FDOQ414645

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

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

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)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• On the structure of linear graphs
• A Measure of Asymptotic Efficiency for Tests of a Hypothesis Based on the sum of Observations
• Asymptotic behavior of the chromatic index for hypergraphs
• Title not available (Why is that?)
• Minimum \(H\)-decompositions of graphs
• Decompositions of graphs into 5-cycles and other small graphs
• Decomposition of graphs into cycles of length seven and single edges.
• Title not available (Why is that?)
• On complete subgraphs of different orders
• The Representation of a Graph by Set Intersections

Cited In (16)

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