MaxCut in ${\bm H)$-Free Graphs

DOI10.1017/S0963548305007017zbMath1081.05047OpenAlexW2171954728MaRDI QIDQ5704383

Michael Krivelevich, Noga Alon, Benjamin Sudakov

Publication date: 14 November 2005

Published in: Combinatorics, Probability and Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1017/s0963548305007017

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35)

Related Items (23)

Maximum bisections of graphs without cycles of length 4 ⋮ Judicious partitions of directed graphs ⋮ MAX-CUT BY EXCLUDING BIPARTITE SUBGRAPHS ⋮ Making an H $H$‐free graph k $k$‐colorable ⋮ Lower Bounds for Maximum Weighted Cut ⋮ Graph partitioning: an updated survey ⋮ New results for MaxCut in H$H$‐free graphs ⋮ Kalai's conjecture in \(r\)-partite \(r\)-graphs ⋮ Unnamed Item ⋮ Maximum cuts of graphs with forbidden cycles ⋮ Lovász, Vectors, Graphs and Codes ⋮ Maximum cuts in \(\mathscr{H} \)-free graphs ⋮ Maximum bisections of graphs without short even cycles ⋮ Modular Orientations of Random and Quasi-Random Regular Graphs ⋮ Making a \(K_4\)-free graph bipartite ⋮ Dense induced bipartite subgraphs in triangle-free graphs ⋮ Max-bisections of \(H\)-free graphs ⋮ MAXIMUM CUTS IN GRAPHS WITHOUT WHEELS ⋮ BIPARTITE SUBGRAPHS OF -FREE GRAPHS ⋮ 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

This page was built for publication: MaxCut in ${\bm H)$-Free Graphs