Packing Cliques in Graphs with Independence Number 2

DOI10.1017/S0963548306008194MaRDI QIDQ5443808zbMATH OpenOpenAlexFDO

Authors Raphael Yuster

Publication date 22 February 2008

Published in Combinatorics, Probability and Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1017/s0963548306008194

Mathematics Subject Classification ID

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

Recommendations

• Near packings of two graphs
• On Packing Two Graphs with Bounded Sum of Sizes and Maximum Degree
• On the minimum number of k-cliques in graphs with restricted independence number
• Packing triangles in \(K_4\)-free graphs
• On Two Conjectures on Packing of Graphs

Cites work

• Asymptotically optimal K_k-packings of dense graphs via fractional K_k-decompositions
• Edge disjoint monochromatic triangles in 2-colored graphs
• Integer and fractional packing of families of graphs
• Integer and fractional packings in dense graphs
• Packing triangles in a graph and its complement
• Some recent problems and results in graph theory

Cited in

(5)

• The complexity of generalized clique packing
• Independence number of graphs with a prescribed number of cliques
• Independence number and packing coloring of generalized Mycielski graphs
• Packing triangles in regular tournaments
• Many disjoint triangles in co-triangle-free graphs

This page was built for publication: Packing Cliques in Graphs with Independence Number 2

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5443808)