Multipartite Turán problem for connected graphs and hypergraphs

DOI10.1016/0012-365X(93)90234-KzbMath0706.05034MaRDI QIDQ919006

Zsolt Tuza

Publication date: 1993

Published in: Discrete Mathematics (Search for Journal in Brave)

zbMATH Keywords

extremal graphshypergraphsextremal problemsTurán-type problemsmaximum number of edgesk- chromatic graph

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Extremal combinatorics (05D99)

Related Items (1)

Monochromatic coverings and tree Ramsey numbers

Cites Work

• An isoperimetric lemma
• Unnamed Item

This page was built for publication: Multipartite Turán problem for connected graphs and hypergraphs