Judicious partitions of hypergraphs
From MaRDI portal
Publication:1356017
DOI10.1006/jcta.1996.2744zbMath0884.05066MaRDI QIDQ1356017
Béla Bollobás, Alexander D. Scott
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
05C65: Hypergraphs
05C70: Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.)
Related Items
Cites Work
- How to make a graph bipartite
- Global versus local asymptotic theories of finite-dimensional normed spaces
- Weighted sums of certain dependent random variables
- `` Strong NP-Completeness Results
- Probability Inequalities for Sums of Bounded Random Variables
- Über die Approximation von Zahlen durch Reihen mit positiven Gliedern
- Some Extremal Properties of Bipartite Subgraphs
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item