The Bollobás--Scott Conjecture for 4-Uniform Hypergraphs
From MaRDI portal
Publication:4605442
DOI10.1137/17M1128484zbMath1380.05143OpenAlexW2785767266WikidataQ123122360 ScholiaQ123122360MaRDI QIDQ4605442
Qinghou Zeng, Wen-Xing Zhu, Shu-Fei Wu, Jian-Feng Hou
Publication date: 22 February 2018
Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/17m1128484
Hypergraphs (05C65) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Related Items (4)
Graph partitioning: an updated survey ⋮ Judiciously 3‐partitioning 3‐uniform hypergraphs ⋮ A bound on judicious bipartitions of directed graphs ⋮ Erratum: The Bollobás--Scott Conjecture for 4-Uniform Hypergraphs
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On judicious partitions of uniform hypergraphs
- On judicious bisections of graphs
- Bisections of graphs
- A bound for judicious \(k\)-partitions of graphs
- Judicious partitions of uniform hypergraphs
- On several partitioning problems of Bollobás and Scott
- Partitioning 3-uniform hypergraphs
- Max \(k\)-cut and judicious \(k\)-partitions
- Judicious \(k\)-partitions of graphs
- On a bottleneck bipartition conjecture of Erdős
- Judicious partitions of hypergraphs
- Maximum cuts and judicious partitions in graphs without short cycles
- Judicious partitions of 3-uniform hypergraphs
- Exact bounds for judicious partitions of graphs
- On judicious partitions of hypergraphs with edges of size at most 3
- The Bollobás-Thomason conjecture for \(3\)-uniform hypergraphs
- Weighted sums of certain dependent random variables
- Problems and results on judicious partitions
- Better Bounds for k-Partitions of Graphs
- Probability Inequalities for Sums of Bounded Random Variables
- Node-and edge-deletion NP-complete problems
- Some Extremal Properties of Bipartite Subgraphs
This page was built for publication: The Bollobás--Scott Conjecture for 4-Uniform Hypergraphs