Efficient covering designs of the complete graph (Q1378499)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Efficient covering designs of the complete graph |
scientific article; zbMATH DE number 1117995
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Efficient covering designs of the complete graph |
scientific article; zbMATH DE number 1117995 |
Statements
Efficient covering designs of the complete graph (English)
0 references
12 February 1998
0 references
Summary: Let \(H\) be a graph. We show that there exists \(n_0=n_0(H)\) such that for every \(n \geq n_0\), there is a covering of the edges of \(K_n\) with copies of \(H\) where every edge is covered at most twice and any two copies intersect in at most one edge. Furthermore, the covering we obtain is asymptotically optimal.
0 references
covering
0 references
