Integer and fractional packing of families of graphs

DOI10.1002/rsa.20048zbMath1061.05076arXivmath/0305350OpenAlexW2951773826MaRDI QIDQ4667859

Raphael Yuster

Publication date: 21 April 2005

Published in: Random Structures & Algorithms (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/math/0305350

zbMATH Keywords

Szemeredi's regularity lemma

Mathematics Subject Classification ID

Combinatorial probability (60C05) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Related Items (18)

Regarding two conjectures on clique and biclique partitions ⋮ Clique decompositions of multipartite graphs and completion of Latin squares ⋮ Dense Graphs With a Large Triangle Cover Have a Large Triangle Packing ⋮ Minimum \(H\)-decompositions of graphs ⋮ Additive approximation for edge-deletion problems ⋮ Integer and fractional packings of hypergraphs ⋮ Packing directed cycles efficiently ⋮ Constructive Packings of Triple Systems ⋮ Packing and Covering a Given Directed Graph in a Directed Graph ⋮ Combinatorial and computational aspects of graph packing and graph decomposition ⋮ Edge-decompositions of graphs with high minimum degree ⋮ Constructive Packings by Linear Hypergraphs ⋮ On the Weisfeiler-Leman dimension of fractional packing ⋮ Packing Cliques in Graphs with Independence Number 2 ⋮ Decomposing Graphs into Edges and Triangles ⋮ Sharp bounds for decomposing graphs into edges and triangles ⋮ Asymptotically optimal \(K_k\)-packings of dense graphs via fractional \(K_k\)-decompositions ⋮ Packing Triangles in Regular Tournaments

Cites Work

• Unnamed Item
• On a packing and covering problem
• Near perfect coverings in graphs and hypergraphs

This page was built for publication: Integer and fractional packing of families of graphs