@book{46b3630ac74f4845aa86f61fd18f49d3,

title = "Hoede-sequences",

abstract = "In an attempt to prove the double-cycle-conjecture for cubic graphs, C. Hoede formulated the following combinatorial problem. “Given a partition of {1, 2, . . . , 3n} 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?��? Let a Hoede-sequence be defined as an increasing sequence of natural numbers of alternating parity. We determine the average number of Hoede-sequences w.r.t. arbitrary partitions, and obtain bounds for the maximum and minimum number of Hoede-sequences w.r.t. partitions into equal classes.",

keywords = "EWI-3411, IR-65778, MSC-05A15, MSC-05A16, MSC-05A18",

author = "F. Gobel",

note = "Imported from MEMORANDA ",

year = "2001",

language = "Undefined",

series = "Memorandum",

publisher = "University of Twente, Department of Applied Mathematics",

number = "1591",

}