Connected covering numbers - Archive ouverte HAL Accéder directement au contenu
Article Dans Une Revue Journal of Combinatorial Designs Année : 2015

Connected covering numbers

Résumé

A connected covering is a design system in which the corresponding block graph is connected. The minimum size of such coverings are called connected coverings numbers. In this paper, we present various formulas and bounds for several parameter settings for these numbers. We also investigate results in connection with Turán systems. Finally, a new general upper bound, improving an earlier result, is given. The latter is used to improve upper bounds on a question concerning oriented matroid due to Las Vergnas.
Fichier principal
Vignette du fichier
connected-covering-numbers-R2.pdf (325.93 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-00837648 , version 1 (24-06-2013)
hal-00837648 , version 2 (27-03-2014)
hal-00837648 , version 3 (13-01-2015)

Identifiants

Citer

Jonathan Chappelon, Kolja Knauer, Luis Pedro Montejano, Jorge Luis Ramírez Alfonsín. Connected covering numbers. Journal of Combinatorial Designs, 2015, 23 (12), pp.534-549. ⟨10.1002/jcd.21425⟩. ⟨hal-00837648v3⟩
217 Consultations
438 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More