On the number of edge disjoint cliques in graphs of given size

DOI10.1007/BF01205075zbMath0755.05049OpenAlexW2152769208MaRDI QIDQ1180425

Ervin Gyoeri

Publication date: 27 June 1992

Published in: Combinatorica (Search for Journal in Brave)

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

zbMATH Keywords

Turán numberedge disjoint cliques

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35)

Related Items (11)

Spectral radius, edge-disjoint cycles and cycles of the same length ⋮ Monochromatic Clique Decompositions of Graphs ⋮ Stability results for graphs with a critical edge ⋮ A proof of the stability of extremal graphs, Simonovits' stability from Szemerédi's regularity ⋮ Monochromatic K_r‐Decompositions of Graphs ⋮ Packing triangles in \(K_4\)-free graphs ⋮ On the number of edge-disjoint triangles in \(K_4\)-free graphs ⋮ Minimum rainbow \(H\)-decompositions of graphs ⋮ Stability Results for Two Classes of Hypergraphs ⋮ Sharp bounds for decomposing graphs into edges and triangles ⋮ On the number of edge-disjoint triangles in \(K_4\)-free graphs

Cites Work

• On complete subgraphs of different orders
• The Representation of a Graph by Set Intersections
• Unnamed Item
• Unnamed Item

This page was built for publication: On the number of edge disjoint cliques in graphs of given size