期刊
DISCRETE MATHEMATICS
卷 310, 期 15-16, 页码 2126-2139出版社
ELSEVIER SCIENCE BV
DOI: 10.1016/j.disc.2010.04.004
关键词
Max cut; Judicious partitions; Extremal graph theory
类别
资金
- NSF [DMS-0505550, CNS-0721983, CCF-0728928]
- ARO [W911NF-06-1-0076]
- Direct For Mathematical & Physical Scien
- Division Of Mathematical Sciences [0906634] Funding Source: National Science Foundation
Alon, et al. (2003) [1] proved that every graph with a large cut has a bipartition in which each vertex class contains correspondingly few edges. We prove an analogous result for partitions into k >= 3 classes; along the way we prove a result for biased bipartitions. (C) 2010 Elsevier B.V. All rights reserved.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据
分享论文
