Judicious partitions of 3-uniform hypergraphs
From MaRDI portal
Publication:1972352
DOI10.1006/eujc.1998.0266zbMath0943.05058MaRDI QIDQ1972352
Béla Bollobás, Alexander D. Scott
Publication date: 26 April 2000
Published in: European Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1006/eujc.1998.0266
05C65: Hypergraphs
05C70: Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.)
Cites Work
- Unnamed Item
- Unnamed Item
- How to make a graph bipartite
- Some simplified NP-complete graph problems
- Judicious partitions of hypergraphs
- The size of the largest bipartite subgraphs
- Bipartite subgraphs
- Über die Approximation von Zahlen durch Reihen mit positiven Gliedern
- Some Extremal Properties of Bipartite Subgraphs