Fractional clique decompositions of dense graphs and hypergraphs
From MaRDI portal
Publication:2407383
DOI10.1016/j.jctb.2017.05.005zbMath1371.05226arXiv1507.04985OpenAlexW2214401133MaRDI QIDQ2407383
Richard Montgomery, Allan Lo, Deryk Osthus, Ben Barber, Daniela Kühn
Publication date: 29 September 2017
Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1507.04985
Extremal problems in graph theory (05C35) Hypergraphs (05C65) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Vertex degrees (05C07) Density (toughness, etc.) (05C42)
Related Items
The Existence of Designs via Iterative Absorption: Hypergraph 𝐹-designs for Arbitrary 𝐹 ⋮ Fractional Triangle Decompositions in Graphs with Large Minimum Degree ⋮ Thresholds for Latin squares and Steiner triple systems: Bounds within a logarithmic factor ⋮ Graph and hypergraph packing ⋮ Minimalist designs ⋮ Fractional Clique Decompositions of Dense Partite Graphs ⋮ Progress towards Nash-Williams' conjecture on triangle decompositions ⋮ Embedding Graphs into Larger Graphs: Results, Methods, and Problems ⋮ Packing degenerate graphs ⋮ On the decomposition threshold of a given graph
Cites Work
- Unnamed Item
- Rational decomposition of dense hypergraphs and some related eigenvalue estimates
- Corrigendum to ``Rational decomposition of dense hypergraphs and some related eigenvalue estimates
- Integer and fractional packings of hypergraphs
- Integer and fractional packings in dense graphs
- An existence theory for pairwise balanced designs. III: Proof of the existence conjectures
- Clique decompositions of multipartite graphs and completion of Latin squares
- An existence theory for pairwise balanced designs. I: Composition theorems and morphisms
- An existence theory for pairwise balanced designs. II: Structure of PBD- closed sets and the existence conjectures
- Asymptotically optimal \(K_k\)-packings of dense graphs via fractional \(K_k\)-decompositions
- Fractional decompositions of dense hypergraphs
- Fractional Triangle Decompositions in Graphs with Large Minimum Degree
- Graph Decomposition is NP-Complete: A Complete Proof of Holyer's Conjecture
- The decomposition threshold for bipartite graphs with minimum degree one
- Fractional Clique Decompositions of Dense Partite Graphs
- Edge-decompositions of graphs with high minimum degree
