Multipartite Turán problem for connected graphs and hypergraphs

Research output: Contribution to journalArticle

1 Citation (Scopus)


Giving a partial solution to a problem of Bialostocki and Dierker, we determine the maximum number of edges in a k-chromatic graph G with color classes of given cardinalities n1,...nk, such that each connected component of G has at most p vertices, p|n1 + ⋯ + nk. We also characterize the extremal graphs and investigate to what extent their properties remain valid when multipartite r-uniform hypergraphs are considered.

Original languageEnglish
Pages (from-to)199-206
Number of pages8
JournalDiscrete Mathematics
Issue number1-3
Publication statusPublished - Mar 25 1993


ASJC Scopus subject areas

  • Theoretical Computer Science
  • Discrete Mathematics and Combinatorics

Cite this