csciencechinapressandspringerverlagberlinheidelberg2015mathscichinacomlinkspringercomjudiciouspartitionsofweightedhypergraphs

CORC > 数学与系统科学研究院 > 中国科学院数学与系统科学研究院 > 应用数学研究所

	csciencechinapressandspringerverlagberlinheidelberg2015mathscichinacomlinkspringercomjudiciouspartitionsofweightedhypergraphs
	Xu Xin; Yan Guiying; Zhang Yao
刊名	sciencechinamathematics
	2016
卷号	59 期号:3 页码:609
ISSN号	1674-7283
英文摘要	Let G be a weighted hypergraph with edges of size i for i = 1, 2. Let wi denote the total weight of edges of size i and be the maximum weight of an edge of size 1. We study the following partitioning problem of Bollobas and Scott: Does there exist a bipartition such that each class meets edges of total weight at least (w_1–α)/2 + (2w2)/3 ? We provide an optimal bound for balanced bipartition of weighted hypergraphs, partially establishing this conjecture. For dense graphs, we also give a result for partitions into more than two classes. In particular, it is shown that any graph G with m edges has a partition V_1, . . ., V_k such that each vertex set meets at least (1 – (1 – 1/k)~2)m + o(m) edges, which answers a related question of Bollobas and Scott.
语种	英语
内容类型	期刊论文
源URL	[http://ir.amss.ac.cn/handle/2S8OKBNM/38810]
专题	应用数学研究所
作者单位	中国科学院数学与系统科学研究院
推荐引用方式 GB/T 7714	Xu Xin,Yan Guiying,Zhang Yao. csciencechinapressandspringerverlagberlinheidelberg2015mathscichinacomlinkspringercomjudiciouspartitionsofweightedhypergraphs[J]. sciencechinamathematics,2016,59(3):609.
APA	Xu Xin,Yan Guiying,&Zhang Yao.(2016).csciencechinapressandspringerverlagberlinheidelberg2015mathscichinacomlinkspringercomjudiciouspartitionsofweightedhypergraphs.sciencechinamathematics,59(3),609.
MLA	Xu Xin,et al."csciencechinapressandspringerverlagberlinheidelberg2015mathscichinacomlinkspringercomjudiciouspartitionsofweightedhypergraphs".sciencechinamathematics 59.3(2016):609.