Judiciously 3‐partitioning 3‐uniform hypergraphs

DOI10.1002/rsa.20908zbMath1450.05062arXiv1810.01731OpenAlexW3005067569MaRDI QIDQ5128756

Hunter Spink, Marius Tiba

Publication date: 26 October 2020

Published in: Random Structures & Algorithms (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1810.01731

zbMATH Keywords

optimizationhypergraphconcentration inequalityAzuma-Hoeffding inequalityjudicious partition

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Hypergraphs (05C65) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Related Items (3)

Graph partitioning: an updated survey ⋮ Optimal bisections of directed graphs ⋮ Erratum: The Bollobás--Scott Conjecture for 4-Uniform Hypergraphs

Cites Work

• Unnamed Item
• Unnamed Item
• Partitioning 3-uniform hypergraphs
• Judicious partitions of graphs
• Judicious partitions of hypergraphs
• Judicious partitions of 3-uniform hypergraphs
• The Bollobás-Thomason conjecture for \(3\)-uniform hypergraphs
• The Bollobás--Scott Conjecture for 4-Uniform Hypergraphs

This page was built for publication: Judiciously 3‐partitioning 3‐uniform hypergraphs