On a problem of G. O. H. Katona and T. Tarján

DOI10.1007/BF01896127zbMath0463.05054OpenAlexW2085357417MaRDI QIDQ3912624

Alexandr V. Kostochka, Ervin Gyoeri

Publication date: 1979

Published in: Acta Mathematica Academiae Scientiarum Hungaricae (Search for Journal in Brave)

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

zbMATH Keywords

smallest partition of the edge set into disjoint complete graphs

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

Spectral radius and clique partitions of graphs, Pairwise balanced designs and sigma clique partitions, Restricted greedy clique decompositions and greedy clique decompositions of \(K_ 4\)-free graphs, Greedy maximum-clique decompositions, Greedy clique decompositions and the Turán numbers, Hypergraph coverings and local colorings, Proof of a conjecture of Katona and Tarjan, Clique coverings and claw-free graphs, Edge clique covering sum of graphs, Friendship decompositions of graphs, A bound on the total size of a cut cover, On the number of edge-disjoint triangles in \(K_4\)-free graphs, Eigenvalues and clique partitions of graphs, On clique coverings of complete multipartite graphs, Sharp bounds for decomposing graphs into edges and triangles, On the number of edge-disjoint triangles in \(K_4\)-free graphs, Covering of graphs by complete bipartite subgraphs; complexity of 0-1 matrices

Cites Work

• The diameter and Laplacian eigenvalues of directed graphs
• The Representation of a Graph by Set Intersections