Bipartite Subgraphs of Triangle-Free Graphs
From MaRDI portal
Publication:4296525
DOI10.1137/S0895480191196824zbMath0806.68086MaRDI QIDQ4296525
Publication date: 13 February 1995
Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)
Related Items (28)
Problems and results on judicious partitions ⋮ Maximum bisections of graphs without cycles of length 4 ⋮ Judicious partitions of directed graphs ⋮ The $\chi$-Ramsey Problem for Triangle-Free Graphs ⋮ Bipartite induced density in triangle-free graphs ⋮ Graph partitioning: an updated survey ⋮ Maximum cuts and judicious partitions in graphs without short cycles ⋮ New results for MaxCut in H$H$‐free graphs ⋮ Bisections of Graphs Without Short Cycles ⋮ Maximum cuts of graphs with forbidden cycles ⋮ Bisections of graphs ⋮ Lovász, Vectors, Graphs and Codes ⋮ Maximum cuts in \(\mathscr{H} \)-free graphs ⋮ Maximum bisections of graphs without short even cycles ⋮ Bisections of graphs without \(K_{2, l}\) ⋮ On existence theorems ⋮ 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 ⋮ 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 ⋮ Some Results on Chromatic Number as a Function of Triangle Count ⋮ Maximum bipartite subgraphs in $H$-free graphs ⋮ The Erdős-Hajnal conjecture for three colors and triangles
This page was built for publication: Bipartite Subgraphs of Triangle-Free Graphs
