Uniform coverings of 2-paths by 4-paths (Q2760452)
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: Uniform coverings of 2-paths by 4-paths |
scientific article; zbMATH DE number 1684688
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Uniform coverings of 2-paths by 4-paths |
scientific article; zbMATH DE number 1684688 |
Statements
2 January 2002
0 references
covering
0 references
\(k\)-path
0 references
Uniform coverings of 2-paths by 4-paths (English)
0 references
The authors construct a set \(S\) of 4-paths in \(K_n\) having the property that each 2-path in \(K_n\) lies in exactly one 4-path in \(S\) for all \(n\geq 5\). A \(k\)-path is a path of length \(k\) where the length of a path is the number of edges in the path.
0 references
