scientific article; zbMATH DE number 4196017

MaRDI QIDQ5203068zbMATH OpenFDO

Authors Zsolt Tuza, Ervin Győri

Publication date 1987

zbMATH Keywords

complete subgraphsedge decompositionTurán graphTurán's theorem

Mathematics Subject Classification ID

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

Recommendations

• On a problem in extremal graph theory
• On the number of complete subgraphs and circuits contained in graphs
• On the decomposition of K_n into complete m‐partite graphs
• Turan's Graph Theorem
• scientific article; zbMATH DE number 3819765

Cited in

(18)

• Hypergraph coverings and local colorings
• On a problem in extremal graph theory
• 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
• An overview of graph covering and partitioning
• A conjecture on triangles of graphs
• Decomposing a graph into two subgraphs with prescribed parities of vertex degrees
• scientific article; zbMATH DE number 426370 (Why is no real title available?)
• A NOTE ON GRAPHS WHOSE DESTRUCTIONS YIELD COMPLETE SUBGRAPHS
• Sharp bounds for decomposing graphs into edges and triangles
• Decomposing graphs into edges and triangles
• On the number of complete subgraphs and circuits contained in graphs
• Minimum rainbow \(H\)-decompositions of graphs
• Minimum rainbow \(H\)-decompositions of graphs
• Sharp bounds for decomposing graphs into edges and triangles
• On Tuza's conjecture in dense graphs
• An unusual decomposition of a complete 7-partite graph of order 28

This page was built for publication:

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