arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1109.2571math.CO
收藏

图的最小H-分解的一个改进的误差项

An improved error term for minimum H-decompositions of graphs

Peter Allen, Julia Böttcher, Yury Person

摘要:

我们考虑将图G的边集划分为固定图H的副本和单边。设G_H(n)表示使得任意n-顶点G允许至多p个部分的划分的最小数p。证明了当χ(H)>2时,H的分解族的极值数为θ_H(n)=ex(n,K_r)+Θ(biex(n,H)).由于biex(n,H)=O(n^{2-γ})对于某些γ>0,这改进了Pikhurko和Sousa [J. Combin.理论系列B 97(2007),1041-1055]。此外,它推广了Özkahya和Person [J. Combin.理论系列B,出现]。

英文摘要:

We consider partitions of the edge set of a graph G into copies of a fixed graph H and single edges. Let ϕ_H(n) denote the minimum number p such that any n-vertex G admits such a partition with at most p parts. We show that ϕ_H(n)=ex(n,K_r)+Θ(biex(n,H)) for χ(H)>2, where biex(n,H) is the extremal number of the decomposition family of H. Since biex(n,H)=O(n^{2-γ}) for some γ>0 this improves on the bound ϕ_H(n)=ex(n,H)+o(n^2) by Pikhurko and Sousa [J. Combin. Theory Ser. B 97 (2007), 1041-1055]. In addition it extends a result of Özkahya and Person [J. Combin. Theory Ser. B, to appear].

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑