An improved error term for minimum \(H\)-decompositions of graphs
From MaRDI portal
Publication:740649
DOI10.1016/j.jctb.2014.03.001zbMath1297.05184arXiv1109.2571OpenAlexW1980010268MaRDI QIDQ740649
Publication date: 4 September 2014
Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1109.2571
Extremal problems in graph theory (05C35) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Related Items (10)
Turán function and \(H\)-decomposition problem for gem graphs ⋮ Monochromatic Clique Decompositions of Graphs ⋮ Turán number and decomposition number of intersecting odd cycles ⋮ 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 ⋮ Some sharp results on the generalized Turán numbers ⋮ Minimum rainbow \(H\)-decompositions of graphs ⋮ Minimum rainbow \(H\)-decompositions of graphs ⋮ Decomposing uniform hypergraphs into uniform hypertrees and single edges ⋮ Decompositions of Graphs into Fans and Single Edges
Cites Work
- Minimum \(H\)-decompositions of graphs: edge-critical case
- Supersaturated graphs and 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
- On a problem of K. Zarankiewicz
- Unnamed Item
This page was built for publication: An improved error term for minimum \(H\)-decompositions of graphs
