On a problem of G. O. H. Katona and T. Tarján
From MaRDI portal
Publication:3912624
DOI10.1007/BF01896127zbMath0463.05054MaRDI QIDQ3912624
Alexandr V. Kostochka, Ervin Gyoeri
Publication date: 1979
Published in: Acta Mathematica Academiae Scientiarum Hungaricae (Search for Journal in Brave)
05C35: Extremal problems in graph theory
05C70: Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.)
Related Items
Covering of graphs by complete bipartite subgraphs; complexity of 0-1 matrices, Friendship decompositions of graphs, 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, Greedy clique decompositions and the Turán numbers, A bound on the total size of a cut cover
Cites Work