Proof of the 1-Factorization and Hamilton Decomposition Conjectures(Memoirs of the American Mathematical Society)

1-因子分解证据与汉密尔顿分解猜想(丛书)

泛函分析

售   价:
745.00
发货周期:外国库房发货,通常付款后3-5周到货
出版时间
2016年10月30日
装      帧
平装
ISBN
9781470420253
复制
页      码
164
语      种
英文
综合评分
暂无评分
我 要 买
- +
库存 50 本
  • 图书详情
  • 目次
  • 买家须知
  • 书评(0)
  • 权威书评(0)
图书简介
In this paper the authors prove the following results (via a unified approach) for all sufficiently large $n$: (i) [[]$1$-factorization conjecture] Suppose that $n$ is even and $Dgeq 2lceil n/4rceil -1$. Then every $D$-regular graph $G$ on $n$ vertices has a decomposition into perfect matchings. Equivalently, $chi’(G)=D$. (ii) [[]Hamilton decomposition conjecture] Suppose that $D ge lfloor n/2 rfloor $. Then every $D$-regular graph $G$ on $n$ vertices has a decomposition into Hamilton cycles and at most one perfect matching. (iii) [[]Optimal packings of Hamilton cycles] Suppose that $G$ is a graph on $n$ vertices with minimum degree $deltage n/2$. Then $G$ contains at least ${rm reg}_{rm even}(n,delta)/2 ge (n-2)/8$ edge-disjoint Hamilton cycles. Here ${rm reg}_{rm even}(n,delta)$ denotes the degree of the largest even-regular spanning subgraph one can guarantee in a graph on $n$ vertices with minimum degree $delta$. (i) was first explicitly stated by Chetwynd and Hilton. (ii) and the special case $delta= lceil n/2 rceil$ of (iii) answer questions of Nash-Williams from 1970. All of the above bounds are best possible.
本书暂无推荐
本书暂无推荐
看了又看
  • 上一个
  • 下一个