Edge-Disjoint Cliques in Graphs with High Minimum Degree

DOI10.1137/130933800zbMath1301.05192OpenAlexW2040044035MaRDI QIDQ3192169

Raphael Yuster

Publication date: 26 September 2014

Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/c46c04d127d414ab5b522da8540d7fe1c4ca019b

zbMATH Keywords

fractionalpackingtriangles

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Related Items (3)

Inapproximability of $H$-Transversal/Packing ⋮ Edge-decompositions of graphs with high minimum degree ⋮ On the decomposition threshold of a given graph

This page was built for publication: Edge-Disjoint Cliques in Graphs with High Minimum Degree