Hoedesequences
Göbel, F. (2001) Hoedesequences. [Report]

PDF
119kB 
Abstract:  In an attempt to prove the doublecycleconjecture for cubic graphs,
C. Hoede formulated the following combinatorial problem. “Given a partition of into n equal classes, is it possible to choose from each class a number such that these numbers form an increasing sequence of alternating parity?U+00e2U+0080? Let a Hoedesequence be defined as an increasing sequence of natural numbers of alternating parity. We determine the average number of Hoedesequences w.r.t. arbitrary partitions, and obtain bounds for the maximum and minimum number of Hoedesequences w.r.t. partitions into equal classes. 
Item Type:  Report 
Additional information:  Imported from MEMORANDA 
Faculty:  Electrical Engineering, Mathematics and Computer Science (EEMCS) 
Link to this item:  http://purl.utwente.nl/publications/65778 
Export this item as:  BibTeX EndNote HTML Citation Reference Manager 
Repository Staff Only: item control page