带洞的圈设计与(5-%27r-，8-%27s-)-圈系.pdfVIP

\ 的− 圈系存在问题的结果和定理1.2.2, 并运用函数论的思想方法找到了一个 界点, 最后在构造出的小阶数图 的 − 圈系的基础上, 运用组合设计的理论和数 学归纳法证明了当 为奇数, 且 ∈ { } 时, Alspach 猜想成立. 第四章, 本文利用在第二章得到的 − \ − 的− 圈系存在问题的结 果和已知的 − \ − 的− 圈系存在问题的结果, 把图 巧妙的分拆成 一些子图的并, 并利用已知图存在− 圈系的结果做了递归构造, 证明了一般的小阶数 图 的 − 圈系存在. 最后利用上述结果, 运用数学归纳法证明了当 为偶数, 且 ∈ { } 时, Alspach 猜想成立. 关键字: − 圈系, 圈分解, 完全图, Alspach 猜想 IV Abstract Combinatorial mathematics is a branch of mathematics on how to arrange (or allocate) the object of discretion under the given constraints.This subject can date back to 2200 BC when our country was still in Dayu times-a flood control era in ancient China,yet it developed so slowly that only untill the invention of computers in 1940s did it begin to develop and grow with an unprecedented speed,and had been widely applied in more and more aspects such as computer networks, digital communications, experimental design and modern business management. The progress of modern science and technology and the rapid development of computer and infor- mation related disciplines make the content of study become ever richer in fields of modular design, graph theory, network theory and coding design in combinatorial mathematics. At the same time,many questions of important theoretical significance and prospects have been raised,such as the famous Alspach’s conjecture which is the object of this article. Let be a complete graph with v vertices, and − be a complete graph with a 1-factor removed . The necessary conditions for the existence of a decomposition of (or − ) into cycles · · · of lengths · · · are: ; (