Vertex covers by edge disjoint cliques

DOI10.1007/S004930100017zbMath0989.05057OpenAlexW1978911338WikidataQ57401535 ScholiaQ57401535MaRDI QIDQ5955194

Tom Bohman, Lubos Thoma, Miklós Ruszinkó, Alan M. Frieze

Publication date: 13 February 2002

Published in: Combinatorica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s004930100017

zbMATH Keywords

coveringrandom graphsextremal graph theory

Mathematics Subject Classification ID

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

Related Items (1)

Embedding Graphs into Larger Graphs: Results, Methods, and Problems

This page was built for publication: Vertex covers by edge disjoint cliques