Disjoint blocking sets in cycle systems

Salvatore Milici, Z. Tuza

Research output: Contribution to journalArticle

6 Citations (Scopus)

Abstract

In an m-cycle system script C sign of order n (n ≥ m ≥ 3 integers), the blocks are the vertex sets of n(n - 1)/(2m) cycles Ci of length m such that each edge of the complete graph Kn belongs to precisely one cycle Ci ∈ script C sign. We investigate m-cycle systems which admit vertex partitions into two or more classes in such a way that each class meets every cycle of script C sign. Relatively small systems (with n ≤ 2m/(em)) are always '2-colorable' in this sense; moreover, for every constant c, if n ≤ cm, then a partition into c1m/log m classes exists (where the constant c1 depends only on c).

Original languageEnglish
Pages (from-to)451-462
Number of pages12
JournalDiscrete Mathematics
Volume208-209
Publication statusPublished - Oct 28 1999

Fingerprint

Blocking Set
Cycle System
Disjoint
Cycle
Vertex Partition
Complete Graph
Partition
Integer
Vertex of a graph
Class

ASJC Scopus subject areas

  • Discrete Mathematics and Combinatorics
  • Theoretical Computer Science

Cite this

Disjoint blocking sets in cycle systems. / Milici, Salvatore; Tuza, Z.

In: Discrete Mathematics, Vol. 208-209, 28.10.1999, p. 451-462.

Research output: Contribution to journalArticle

Milici, S & Tuza, Z 1999, 'Disjoint blocking sets in cycle systems', Discrete Mathematics, vol. 208-209, pp. 451-462.
Milici, Salvatore ; Tuza, Z. / Disjoint blocking sets in cycle systems. In: Discrete Mathematics. 1999 ; Vol. 208-209. pp. 451-462.
@article{21915716ed1e468f9b95baf415f4191e,
title = "Disjoint blocking sets in cycle systems",
abstract = "In an m-cycle system script C sign of order n (n ≥ m ≥ 3 integers), the blocks are the vertex sets of n(n - 1)/(2m) cycles Ci of length m such that each edge of the complete graph Kn belongs to precisely one cycle Ci ∈ script C sign. We investigate m-cycle systems which admit vertex partitions into two or more classes in such a way that each class meets every cycle of script C sign. Relatively small systems (with n ≤ 2m/(em)) are always '2-colorable' in this sense; moreover, for every constant c, if n ≤ cm, then a partition into c1m/log m classes exists (where the constant c1 depends only on c).",
author = "Salvatore Milici and Z. Tuza",
year = "1999",
month = "10",
day = "28",
language = "English",
volume = "208-209",
pages = "451--462",
journal = "Discrete Mathematics",
issn = "0012-365X",
publisher = "Elsevier",

}

TY - JOUR

T1 - Disjoint blocking sets in cycle systems

AU - Milici, Salvatore

AU - Tuza, Z.

PY - 1999/10/28

Y1 - 1999/10/28

N2 - In an m-cycle system script C sign of order n (n ≥ m ≥ 3 integers), the blocks are the vertex sets of n(n - 1)/(2m) cycles Ci of length m such that each edge of the complete graph Kn belongs to precisely one cycle Ci ∈ script C sign. We investigate m-cycle systems which admit vertex partitions into two or more classes in such a way that each class meets every cycle of script C sign. Relatively small systems (with n ≤ 2m/(em)) are always '2-colorable' in this sense; moreover, for every constant c, if n ≤ cm, then a partition into c1m/log m classes exists (where the constant c1 depends only on c).

AB - In an m-cycle system script C sign of order n (n ≥ m ≥ 3 integers), the blocks are the vertex sets of n(n - 1)/(2m) cycles Ci of length m such that each edge of the complete graph Kn belongs to precisely one cycle Ci ∈ script C sign. We investigate m-cycle systems which admit vertex partitions into two or more classes in such a way that each class meets every cycle of script C sign. Relatively small systems (with n ≤ 2m/(em)) are always '2-colorable' in this sense; moreover, for every constant c, if n ≤ cm, then a partition into c1m/log m classes exists (where the constant c1 depends only on c).

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

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

M3 - Article

VL - 208-209

SP - 451

EP - 462

JO - Discrete Mathematics

JF - Discrete Mathematics

SN - 0012-365X

ER -