1. Connected Covering Numbers.
- Author
-
Chappelon, Jonathan, Knauer, Kolja, Montejano, Luis Pedro, and Ramírez Alfonsín, Jorge Luis
- Subjects
- *
GRAPH theory , *MATHEMATICAL bounds , *ORIENTED matroids , *INTEGERS , *COMBINATORIAL designs & configurations - Abstract
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. [ABSTRACT FROM AUTHOR]
- Published
- 2015
- Full Text
- View/download PDF