Multipartite Turán problem for connected graphs and hypergraphs
type: Item
instance of: scholarly article
title: Multipartite Turán problem for connected graphs and hypergraphs
zbMATH Open document ID: 0706.05034
DOI: 10.1016/0012-365X(93)90234-K
author: Zsolt Tuza
published in: Discrete Mathematics
publication date: 1993-01-01T00:00:00Z
review text: We determine the maximum number of edges in a k-chromatic graph G with color classes of given cardinalities \(n_ 1,...,n_ k\), such that each connected component of G has at most p vertices (where \(n_ 1+...+n_ k\) is a multiple of p). We also characterize the extremal graphs and investigate to what extent their properties remain valid when multipartite r-uniform hypergraphs are considered. For hypergraphs, the general problem remains open.
Mathematics Subject Classification ID: 05C35
Mathematics Subject Classification ID: 05D99
zbMATH DE Number: 4158658
zbMATH Keywords: extremal problems
zbMATH Keywords: Turán-type problems
zbMATH Keywords: maximum number of edges
zbMATH Keywords: k- chromatic graph
zbMATH Keywords: extremal graphs
zbMATH Keywords: hypergraphs
MaRDI profile type: Publication
cites work: An isoperimetric lemma
cites work: Q3803144
description: scientific article; zbMATH DE number 4158658