### Abstract

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 n_{1},...n_{k}, such that each connected component of G has at most p vertices, p|n_{1} + ⋯ + n_{k}. We also characterize the extremal graphs and investigate to what extent their properties remain valid when multipartite r-uniform hypergraphs are considered.

Original language | English |
---|---|

Pages (from-to) | 199-206 |

Number of pages | 8 |

Journal | Discrete Mathematics |

Volume | 112 |

Issue number | 1-3 |

DOIs | |

Publication status | Published - Mar 25 1993 |

### Fingerprint

### ASJC Scopus subject areas

- Theoretical Computer Science
- Discrete Mathematics and Combinatorics