Edge-Disjoint Cliques in Graphs with High Minimum Degree

DOI10.1137/130933800zbMATH Open1301.05192OpenAlexW2040044035MaRDI QIDQ3192169FDOQ3192169

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

Recommendations

• scientific article; zbMATH DE number 426342
• On the number of edge disjoint cliques in graphs of given size
• Edge-decompositions of graphs with high minimum degree
• Edge-decompositions of graphs with high minimum degree
• Cliques in graphs with bounded minimum degree
• Cliques in graphs with bounded minimum degree
• Disjoint cliques and disjoint maximal independent sets of vertices in graphs
• Edge-disjoint induced subgraphs with given minimum degree
• Disjoint cliques in claw-free graphs
• scientific article; zbMATH DE number 951848

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)

Cited In (4)

• Edge-decompositions of graphs with high minimum degree
• On the decomposition threshold of a given graph
• Vertex covers by edge disjoint cliques
• Inapproximability of $H$-Transversal/Packing

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

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