5-cycle systems of \(\lambda(K_v-K_u)\) (Q2747190)
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: 5-cycle systems of \(\lambda(K_v-K_u)\) |
scientific article; zbMATH DE number 1657307
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | 5-cycle systems of \(\lambda(K_v-K_u)\) |
scientific article; zbMATH DE number 1657307 |
Statements
29 March 2002
0 references
cycle system
0 references
cycle decomposition
0 references
\(\lambda\)-fold complete graph
0 references
5-cycle systems of \(\lambda(K_v-K_u)\) (English)
0 references
The multigraph \(\lambda (K_v - K_u)\) is a graph on a vertex set \(V\), \(|V|= v\), with a set \(U\subseteq V\), \(|U|= u\), in which there are exactly \(\lambda\) edges between each pair of vertices \(a,b\in V\), where \(a\) or \(b\) is not in \(U\). The author characterizes all positive integers \(\lambda, v\), and \(u\) such that the edges of \(\lambda (K_v - K_u)\) can be partitioned into 5-element subsets each of which forms a 5-cycle in \(\lambda (K_v - K_u)\).
0 references
0.8461065292358398
0 references
0.8288585543632507
0 references
0.7673565745353699
0 references