Asymptotically optimal \(K_k\)-packings of dense graphs via fractional \(K_k\)-decompositions
From MaRDI portal
Publication:2565683
DOI10.1016/j.jctb.2005.02.002zbMath1070.05071arXivmath/0311449OpenAlexW1997702119MaRDI QIDQ2565683
Publication date: 28 September 2005
Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/math/0311449
Related Items (13)
Clique decompositions of multipartite graphs and completion of Latin squares ⋮ Fractional Triangle Decompositions in Graphs with Large Minimum Degree ⋮ Fractional clique decompositions of dense graphs and hypergraphs ⋮ Rational decomposition of dense hypergraphs and some related eigenvalue estimates ⋮ Fractional Clique Decompositions of Dense Partite Graphs ⋮ Combinatorial and computational aspects of graph packing and graph decomposition ⋮ Progress towards Nash-Williams' conjecture on triangle decompositions ⋮ Edge-decompositions of graphs with high minimum degree ⋮ Packing Cliques in Graphs with Independence Number 2 ⋮ On the Minimum Degree Required for a Triangle Decomposition ⋮ Packing Triangles in Regular Tournaments ⋮ On the decomposition threshold of a given graph ⋮ Fractional decompositions of dense hypergraphs
Cites Work
- Integer and fractional packings in dense graphs
- On a packing and covering problem
- Near perfect coverings in graphs and hypergraphs
- Packing graphs: The packing problem solved
- Asymptotically good list-colorings
- Integer and fractional packing of families of graphs
- The decomposition threshold for bipartite graphs with minimum degree one
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Asymptotically optimal \(K_k\)-packings of dense graphs via fractional \(K_k\)-decompositions
