Maximum cuts and judicious partitions in graphs without short cycles
From MaRDI portal
Publication:1400968
DOI10.1016/S0095-8956(03)00036-4zbMath1030.05060MaRDI QIDQ1400968
Michael Krivelevich, Noga Alon, Benjamin Sudakov, Béla Bollobás
Publication date: 17 August 2003
Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)
Related Items
On judicious partitions of uniform hypergraphs, Biased partitions and judicious \(k\)-partitions of graphs, Maximum bisections of graphs without cycles of length 4, Judicious partitions of directed graphs, On several partitioning problems of Bollobás and Scott, Bounds for pairs in judicious partitioning of graphs, On judicious bisections of graphs, MAX-CUT BY EXCLUDING BIPARTITE SUBGRAPHS, Making an H $H$‐free graph k $k$‐colorable, Graph partitioning: an updated survey, New results for MaxCut in H$H$‐free graphs, Bisections of Graphs Without Short Cycles, Optimal bisections of directed graphs, Defective coloring of hypergraphs, The Bollobás--Scott Conjecture for 4-Uniform Hypergraphs, Judicious Partitioning of Hypergraphs with Edges of Size at Most 2, Maximum cuts of graphs with forbidden cycles, Bisections of graphs, Balanced Judicious Bipartition is Fixed-Parameter Tractable, Lovász, Vectors, Graphs and Codes, Maximum cuts in \(\mathscr{H} \)-free graphs, Maximum bisections of graphs without short even cycles, Making a \(K_4\)-free graph bipartite, Dense induced bipartite subgraphs in triangle-free graphs, On the small cycle transversal of planar graphs, Bounds for pairs in partitions of graphs, Max \(k\)-cut and judicious \(k\)-partitions, On the Small Cycle Transversal of Planar Graphs, On judicious bipartitions of graphs, New kernels for several problems on planar graphs, Judicious \(k\)-partitions of graphs, MAXIMUM CUTS IN GRAPHS WITHOUT WHEELS, BIPARTITE SUBGRAPHS OF -FREE GRAPHS, On a Problem of Judiciousk-Partitions of Graphs, Partitioning 3-uniform hypergraphs, Balanced Judicious Bipartition is Fixed-Parameter Tractable, Maximum bipartite subgraphs in graphs without short cycles, Hypergraph cuts above the average, Lower Bounds for Max-Cut in $H$-Free Graphs via Semidefinite Programming, Maximum bipartite subgraphs in $H$-free graphs, On judicious partitions of hypergraphs with edges of size at most 3
Cites Work
- On a bottleneck bipartition conjecture of Erdős
- Explicit Ramsey graphs and orthonormal labelings
- Bipartite subgraphs of integer weighted graphs
- Cycles of even length in graphs
- Exact bounds for judicious partitions of graphs
- Bipartite subgraphs
- The Difference Between Consecutive Primes, II
- A note on bipartite subgraphs of triangle‐free graphs
- Bipartite Subgraphs of Triangle-Free Graphs
- Turán Numbers of Bipartite Graphs and Related Ramsey-Type Questions
- Some Extremal Properties of Bipartite Subgraphs
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
