Covering the complete graph by partitions

Research output: Contribution to journalArticle

7 Citations (Scopus)


A (D, c)-coloring of the complete graph Kn is a coloring of the edges with c colors such that all monochromatic connected subgraphs have at most D vertices. Resolvable block designs with c parallel classes and with block size D are natural examples of (D, c)-colorings. However, (D, c)-colorings are more relaxed structures. We investigate the largest n such that Kn has a (D, c)-coloring. Our main tool is the fractional matching theory of hypergraphs.

Original languageEnglish
Pages (from-to)217-226
Number of pages10
JournalDiscrete Mathematics
Issue number1-3
Publication statusPublished - May 1989

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Discrete Mathematics and Combinatorics

Fingerprint Dive into the research topics of 'Covering the complete graph by partitions'. Together they form a unique fingerprint.

  • Cite this