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

DOI10.1007/BF01896127MaRDI QIDQ3912624zbMATH OpenOpenAlexFDO

Authors Ervin Győri, Alexandr Kostochka

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)

Cites work

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

Cited in

(18)

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

This page was built for publication: On a problem of G. O. H. Katona and T. Tarján

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