Covering the Complete Graph by Partitions

Research output: Contribution to journalArticle

3 Citations (Scopus)

Abstract

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
JournalAnnals of Discrete Mathematics
Volume43
Issue numberC
DOIs
Publication statusPublished - 1989

Fingerprint

Complete Graph
Colouring
Covering
Partition
Resolvable Design
Block Design
Hypergraph
Subgraph
Fractional

ASJC Scopus subject areas

  • Discrete Mathematics and Combinatorics

Cite this

Covering the Complete Graph by Partitions. / Füredi, Z.

In: Annals of Discrete Mathematics, Vol. 43, No. C, 1989, p. 217-226.

Research output: Contribution to journalArticle

@article{62fd6ca50fce441b914998b85862e385,
title = "Covering the Complete Graph by Partitions",
abstract = "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.",
author = "Z. F{\"u}redi",
year = "1989",
doi = "10.1016/S0167-5060(08)70576-4",
language = "English",
volume = "43",
pages = "217--226",
journal = "Annals of Discrete Mathematics",
issn = "0167-5060",
publisher = "Elsevier",
number = "C",

}

TY - JOUR

T1 - Covering the Complete Graph by Partitions

AU - Füredi, Z.

PY - 1989

Y1 - 1989

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=77957044132&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=77957044132&partnerID=8YFLogxK

U2 - 10.1016/S0167-5060(08)70576-4

DO - 10.1016/S0167-5060(08)70576-4

M3 - Article

AN - SCOPUS:77957044132

VL - 43

SP - 217

EP - 226

JO - Annals of Discrete Mathematics

JF - Annals of Discrete Mathematics

SN - 0167-5060

IS - C

ER -