The Bollobás-Thomason conjecture for 3-uniform hypergraphs

DOI10.1007/S00493-012-2696-XMaRDI QIDQ2454588zbMATH OpenOpenAlexWikidataFDO

Authors John Haslegrave

Publication date 13 June 2014

Published in Combinatorica (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s00493-012-2696-x

zbMATH Keywords

3-uniform hypergraphpartitionsuniform hypergraphs

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)

Recommendations

• Partitioning 3-uniform hypergraphs
• Judicious partitions of 3-uniform hypergraphs
• On judicious partitions of uniform hypergraphs
• Partitioning dense uniform hypergraphs
• Judicious partitions of uniform hypergraphs

Cites work

• Bipartite subgraphs of integer weighted graphs
• Exact bounds for judicious partitions of graphs
• Graph partitions. II
• scientific article; zbMATH DE number 475586 (Why is no real title available?)
• scientific article; zbMATH DE number 1179517 (Why is no real title available?)
• scientific article; zbMATH DE number 1787231 (Why is no real title available?)
• Judicious partitions and related problems
• Judicious partitions of 3-uniform hypergraphs
• Judicious partitions of hypergraphs
• Judicious partitions of uniform hypergraphs
• On a bottleneck bipartition conjecture of Erdős
• Problems and results on judicious partitions

Cited in

(16)

• Partitioning dense uniform hypergraphs
• Proof of a conjecture of Bollobás and Eldridge for graphs of maximum degree three
• Judicious partitions of 3-uniform hypergraphs
• On judicious partitions of hypergraphs with edges of size at most 3
• On judicious partitions of uniform hypergraphs
• Judicious partitions of weighted hypergraphs
• Judicious partitions of directed graphs
• The Bollobás-Scott conjecture for 4-uniform hypergraphs
• Bisections of graphs
• A Disproof of the Fon-der-Flaass Conjecture
• Judicious partitions of uniform hypergraphs
• Judiciously 3-partitioning 3-uniform hypergraphs
• Judicious partitioning of hypergraphs with edges of size at most 2
• Graph partitioning: an updated survey
• Optimal bisections of directed graphs
• Partitioning 3-uniform hypergraphs

This page was built for publication: The Bollobás-Thomason conjecture for \(3\)-uniform hypergraphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2454588)