Judicious partitions of hypergraphs

DOI10.1006/JCTA.1996.2744zbMATH Open0884.05066OpenAlexW2022684130MaRDI QIDQ1356017FDOQ1356017

Alex Scott, Béla Bollobás

Publication date: 28 January 1998

Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1006/jcta.1996.2744

zbMATH Keywords

3-uniform hypergraphvertex partition of hypergraphs

Mathematics Subject Classification ID

Hypergraphs (05C65) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Cites Work

• Probability Inequalities for Sums of Bounded Random Variables
• Global versus local asymptotic theories of finite-dimensional normed spaces
• How to make a graph bipartite
• Weighted sums of certain dependent random variables
• Some Extremal Properties of Bipartite Subgraphs
• `` Strong NP-Completeness Results
• Über die Approximation von Zahlen durch Reihen mit positiven Gliedern
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)

Cited In (33)

• On bisections of graphs without complete bipartite graphs
• Problems and results on judicious partitions
• Bisections of Graphs Without Short Cycles
• On judicious partitions of uniform hypergraphs
• Partitioning problems in dense hypergraphs
• Balanced Judicious Bipartition is Fixed-Parameter Tractable
• Judicious partitions of bounded‐degree graphs
• Max \(k\)-cut and judicious \(k\)-partitions
• Judicious partitions of uniform hypergraphs
• Judicious Partitioning of Hypergraphs with Edges of Size at Most 2
• Simple probabilistic analysis to generalize bottleneck graph multi-partitioning
• Partitioning 3-uniform hypergraphs
• The Bollobás--Scott Conjecture for 4-Uniform Hypergraphs
• Judicious bisection of hypergraphs
• Graph partitioning: an updated survey
• On judicious partitions of hypergraphs with edges of size at most 3
• Bounds for pairs in partitions of graphs
• Bipartitions of oriented graphs
• Judiciously 3‐partitioning 3‐uniform hypergraphs
• The Bollobás-Thomason conjecture for \(3\)-uniform hypergraphs
• On several partitioning problems of Bollobás and Scott
• A bound on judicious bipartitions of directed graphs
• Optimal bisections of directed graphs
• Exact bounds for judicious partitions of graphs
• Balanced Judicious Bipartition is Fixed-Parameter Tractable
• Judicious partitions of 3-uniform hypergraphs
• On judicious bipartitions of directed graphs
• Partitions of hypergraphs under variable degeneracy constraints
• Erratum: The Bollobás--Scott Conjecture for 4-Uniform Hypergraphs
• Bounds for pairs in judicious partitioning of graphs
• The partition of a uniform hypergraph into pairs of dependent hyperedges
• A note on judicious bisections of graphs
• Partitioning dense uniform hypergraphs

This page was built for publication: Judicious partitions of hypergraphs

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