A note on bipartite subgraphs of triangle‐free graphs
From MaRDI portal
Publication:3990224
DOI10.1002/rsa.3240030211zbMath0765.05057OpenAlexW2021529197MaRDI QIDQ3990224
Publication date: 28 June 1992
Published in: Random Structures & Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/rsa.3240030211
Related Items (29)
Problems and results on judicious partitions ⋮ Maximum bisections of graphs without cycles of length 4 ⋮ Bounds on the bisection width for random \(d\)-regular graphs ⋮ Linear-Time Approximation Algorithms for the Max Cut Problem ⋮ Large cuts with local algorithms on triangle-free graphs ⋮ MAX-CUT BY EXCLUDING BIPARTITE SUBGRAPHS ⋮ Lower Bounds for Maximum Weighted Cut ⋮ Graph partitioning: an updated survey ⋮ Maximum cuts and judicious partitions in graphs without short cycles ⋮ New results for MaxCut in H$H$‐free graphs ⋮ The Spectrum of Triangle-Free Graphs ⋮ Maximum cuts of graphs with forbidden cycles ⋮ Cleaning with brooms ⋮ Cleaning random \(d\)-regular graphs with brooms ⋮ 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 ⋮ Local approximation of the maximum cut in regular graphs ⋮ MAXIMUM CUTS IN GRAPHS WITHOUT WHEELS ⋮ BIPARTITE SUBGRAPHS OF -FREE GRAPHS ⋮ Maximum bipartite subgraphs in graphs without short cycles ⋮ Bipartite subgraphs ⋮ Hypergraph cuts above the average ⋮ Lower Bounds for Max-Cut in $H$-Free Graphs via Semidefinite Programming ⋮ Maximum cuts: Improvements and local algorithmic analogues of the Edwards-Erdős inequality ⋮ Regular honest graphs, isoperimetric numbers, and bisection of weighted graphs ⋮ Judicious partitions of graphs ⋮ Maximum bipartite subgraphs in $H$-free graphs
Cites Work
This page was built for publication: A note on bipartite subgraphs of triangle‐free graphs
