Proof of a conjecture of Katona and Tarjan

DOI10.1007/BF01848173zbMath0429.05049OpenAlexW2056635150WikidataQ122973123 ScholiaQ122973123MaRDI QIDQ1137599

Jeffry Kahn

Publication date: 1981

Published in: Periodica Mathematica Hungarica (Search for Journal in Brave)

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

zbMATH Keywords

Turan graphcovering by cliques

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Graph theory (05C99) Combinatorial aspects of packing and covering (05B40)

Related Items

Spectral radius and clique partitions of graphs, On the Decomposition of Graphs, Pairwise balanced designs and sigma clique partitions, Clique coverings and claw-free graphs, Edge clique covering sum of graphs, A bound on the total size of a cut cover, Eigenvalues and clique partitions of graphs, Decomposing Graphs into Edges and Triangles, On clique coverings of complete multipartite graphs, Sharp bounds for decomposing graphs into edges and triangles

Cites Work

• On a problem of G. O. H. Katona and T. Tarján
• On the Decomposition of Graphs