2013/06/24 by Jonathan Chappelon, Chappelon, Jonathan, Kolja Knauer +6
Computer Science · Engineering · Mathematics · #Advanced Graph Theory Research #Combinatorics (math.CO) #FOS: Mathematics #Limits and Structures in Graph Theory #graph theory and CDMA systems #math.CO
paper · pdf · doi:10.48550/arxiv.1306.5636
15 pages, 4 figures, 1 table
openalex publication_date 2013/06/24 · arxiv created 2015/01/13 · arxiv updated 2015/01/14 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
A connected covering is a design system in which the corresponding \em block graph is connected. The minimum size of such coverings are called \em 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 \em 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.