每个无射线图都有一个不友好划分
组合数学
2009-12-21 v3
摘要
我们证明每个无射线图都有一个不友好划分。
引用
@article{arxiv.0901.4858,
title = {Every rayless graph has an unfriendly partition},
author = {Henning Bruhn and Reinhard Diestel and Agelos Georgakopoulos and Philipp Sprüssel},
journal= {arXiv preprint arXiv:0901.4858},
year = {2009}
}
备注
Final, slightly modified, version. To appear in combinatorica