Pages that link to "Item:Q1200279"
From MaRDI portal
The following pages link to On a bottleneck bipartition conjecture of Erdős (Q1200279):
Displaying 21 items.
- Judicious partitions of weighted hypergraphs (Q295108) (← links)
- On judicious bisections of graphs (Q402590) (← links)
- Judicious partitions of uniform hypergraphs (Q484549) (← links)
- On several partitioning problems of Bollobás and Scott (Q602718) (← links)
- On a bipartition problem of Bollobás and Scott (Q624186) (← links)
- A note on balanced bipartitions (Q709305) (← links)
- Simple probabilistic analysis to generalize bottleneck graph multi-partitioning (Q714518) (← links)
- Economical tight examples for the biased Erdős-Selfridge theorem (Q932605) (← links)
- Bounds for pairs in partitions of graphs (Q982612) (← links)
- Max \(k\)-cut and judicious \(k\)-partitions (Q982619) (← links)
- Judicious \(k\)-partitions of graphs (Q1003836) (← links)
- Maximum cuts and judicious partitions in graphs without short cycles (Q1400968) (← links)
- Bounds for judicious balanced bipartitions of graphs (Q1756085) (← links)
- The Bollobás-Thomason conjecture for \(3\)-uniform hypergraphs (Q2454588) (← links)
- Judicious partitions of bounded‐degree graphs (Q4474279) (← links)
- The Bollobás--Scott Conjecture for 4-Uniform Hypergraphs (Q4605442) (← links)
- Problems and results on judicious partitions (Q4798176) (← links)
- On a Problem of Judicious<i>k</i>-Partitions of Graphs (Q4978292) (← links)
- Balanced judicious bipartitions of graphs (Q5190331) (← links)
- Graph partitioning: an updated survey (Q6110873) (← links)
- Optimal bisections of directed graphs (Q6185053) (← links)
