Partitioning dense uniform hypergraphs

被引：1

作者：

Wu, Shufei ^{[1
,2
]}

Hou, Jianfeng ^{[2
]}

机构：

[1] Henan Polytech Univ, Sch Math & Informat Sci, Jiaozuo 454000, Henan, Peoples R China

[2] Fuzhou Univ, Ctr Discrete Math, Fuzhou 350003, Fujian, Peoples R China

来源：

JOURNAL OF COMBINATORIAL OPTIMIZATION | 2018年 / 35卷 / 01期

基金：

中国国家自然科学基金;

关键词：

Hypergraph; Partition; Max-Cut; Azuma-Hoeffding inequality; JUDICIOUS K-PARTITIONS; BIPARTITIONS; BOUNDS;

D O I：

10.1007/s10878-017-0153-x

中图分类号：

TP39 [计算机的应用];

学科分类号：

081203 ; 0835 ;

摘要：

Let and be fixed integers, and let H be an r-uniform hypergraph with n vertices and m edges. In 1997, Bollobas and Scott conjectured that H has a vertex-partition into k sets with at most edges in each set. So far, this conjecture was confirmed when or . In this paper, we show that it holds for for any .

引用

页码：48 / 63

页数：16

共 50 条

[1] Partitioning dense uniform hypergraphs
Shufei Wu
Jianfeng Hou
Journal of Combinatorial Optimization, 2018, 35 : 48 - 63
[2] Partitioning problems in dense hypergraphs
Czygrinow, A
DISCRETE APPLIED MATHEMATICS, 2002, 116 (03) : 179 - 191
[3] Partitioning 3-uniform hypergraphs
Ma, Jie
Yu, Xingxing
JOURNAL OF COMBINATORIAL THEORY SERIES B, 2012, 102 (01) : 212 - 232
[4] Dense Peelable Random Uniform Hypergraphs
Dietzfelbinger, Martin
Walzer, Stefan
27TH ANNUAL EUROPEAN SYMPOSIUM ON ALGORITHMS (ESA 2019), 2019, 144
[5] Degree sequences of sufficiently dense random uniform hypergraphs
Greenhill, Catherine
Isaev, Mikhail
Makai, Tamas
McKay, Brendan D.
COMBINATORICS PROBABILITY AND COMPUTING, 2023, 32 (02) : 183 - 224
[6] Judiciously 3-partitioning 3-uniform hypergraphs
Spink, Hunter
Tiba, Marius
RANDOM STRUCTURES & ALGORITHMS, 2020, 56 (04) : 1205 - 1221
[7] Dense uniform hypergraphs have high list chromatic number
Alon, Noga
Kostochka, Alexandr
DISCRETE MATHEMATICS, 2012, 312 (14) : 2119 - 2125
[8] Dense 3-uniform hypergraphs containing a large clique
Wu, Biao
Peng, Yuejian
SCIENCE CHINA-MATHEMATICS, 2018, 61 (03) : 577 - 592
[9] Integer and fractional packings in dense 3-uniform hypergraphs
Haxell, P
Nagle, B
Rödl, V
RANDOM STRUCTURES & ALGORITHMS, 2003, 22 (03) : 248 - 310
[10] Dense 3-uniform hypergraphs containing a large clique
Biao Wu
Yuejian Peng
Science China Mathematics, 2018, 61 : 577 - 592

← 1 2 3 4 5 →