On judicious partitions of hypergraphs with edges of size at most 3

doi:10.1016/j.ejc.2015.03.015

CSpace > 应用数学研究所

	On judicious partitions of hypergraphs with edges of size at most 3
	Zhang, Yao; Tang, Yu Cong; Yan, Gui Ying
	2015-10-01
发表期刊	EUROPEAN JOURNAL OF COMBINATORICS
ISSN	0195-6698
卷号	49 页码:232-239
摘要	Bollobas and Scott (2002) conjectured that a hypergraph with m(i) edges of size i for i = 1, . . . , k has a bipartition in which each vertex class meets at least m(1)/2+3m(2)/4+ . . . +(1-1/2(k))m(k)+o(m) edges where m = Sigma(k)(i=1) m(i). For the case k = 2, this conjecture has been proved by Ma et al. (2010). In this paper, we consider this conjecture for the case k = 3. In fact, we prove that a hypergraph with mi edges of size i for i = 1, 2, 3 has a bipartition in which each vertex class meets at least m(1)/2 + 3m(2)/4+ 23m(3)/27 + o(m) edges where m = m(1) + m(2) + m(3). (C) 2015 Elsevier Ltd. All rights reserved.
DOI	10.1016/j.ejc.2015.03.015
语种	英语
WOS研究方向	Mathematics
WOS类目	Mathematics
WOS记录号	WOS:000356199600018
出版者	ACADEMIC PRESS LTD- ELSEVIER SCIENCE LTD
引用统计
文献类型	期刊论文
条目标识符	http://ir.amss.ac.cn/handle/2S8OKBNM/19961
专题	应用数学研究所
通讯作者	Zhang, Yao
作者单位	Chinese Acad Sci, Acad Math & Syst Sci, Beijing 100190, Peoples R China
推荐引用方式 GB/T 7714	Zhang, Yao,Tang, Yu Cong,Yan, Gui Ying. On judicious partitions of hypergraphs with edges of size at most 3[J]. EUROPEAN JOURNAL OF COMBINATORICS,2015,49:232-239.
APA	Zhang, Yao,Tang, Yu Cong,&Yan, Gui Ying.(2015).On judicious partitions of hypergraphs with edges of size at most 3.EUROPEAN JOURNAL OF COMBINATORICS,49,232-239.
MLA	Zhang, Yao,et al."On judicious partitions of hypergraphs with edges of size at most 3".EUROPEAN JOURNAL OF COMBINATORICS 49(2015):232-239.