Multipartite Turán problem for connected graphs and hypergraphs

DOI10.1016/0012-365X(93)90234-KMaRDI QIDQ919006zbMATH OpenFDO

Authors Zsolt Tuza

Publication date 1993

Published in Discrete Mathematics (Search for Journal in Brave)

zbMATH Keywords

extremal problemsextremal graphshypergraphsmaximum number of edgesk- chromatic graphTurán-type problems

Mathematics Subject Classification ID

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

Recommendations

• Extremal problems for \(t\)-partite and \(t\)-colorable hypergraphs
• Multicolour Turán problems
• Edge coloring complete uniform hypergraphs with many components
• On Connected Components with Many Edges
• Partition of graphs and hypergraphs into monochromatic connected parts

Cites work

• scientific article; zbMATH DE number 4070935 (Why is no real title available?)
• An isoperimetric lemma

Cited in

(8)

• scientific article; zbMATH DE number 5942358 (Why is no real title available?)
• A Multipartite Version of the Hajnal–Szemerédi Theorem for Graphs and Hypergraphs
• Turán-type results for complete h-partite graphs in comparability and incomparability graphs
• scientific article; zbMATH DE number 4214052 (Why is no real title available?)
• Turán function and H-decomposition problem for gem graphs
• Extremal problems for \(t\)-partite and \(t\)-colorable hypergraphs
• Monochromatic coverings and tree Ramsey numbers
• An isoperimetric lemma

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

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