The \(\mu\)-way intersection problem for \(m\)-cycle systems (Q5937574)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 1619825
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The \(\mu\)-way intersection problem for \(m\)-cycle systems |
scientific article; zbMATH DE number 1619825 |
Statements
The \(\mu\)-way intersection problem for \(m\)-cycle systems (English)
0 references
1 October 2001
0 references
A partition of a complete graph of order \(v\) into \(m\)-cycles is called an \(m\)-cycle system of order \(v\). In the paper under review, the authors consider the problem for finding all possible numbers of cycles which can be common to \(\mu\) \(m\)-cycle systems based on the same vertex \(v\)-set. General results for arbitrary \(m\) are obtained and intersection values for some small values of \(m\) and \(\mu\) are determined.
0 references
cycle systems
0 references
intersection problem
0 references
0.8685081005096436
0 references
0.7883284687995911
0 references
