Bipartite subgraphs
From MaRDI portal
Publication:2563506
DOI10.1007/BF01261315zbMath0860.05043OpenAlexW4246647751MaRDI QIDQ2563506
Publication date: 21 April 1997
Published in: Combinatorica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf01261315
Related Items (53)
Degree Ramsey Numbers of Graphs ⋮ On judicious partitions of uniform hypergraphs ⋮ Dense Graphs With a Large Triangle Cover Have a Large Triangle Packing ⋮ Problems and results on judicious partitions ⋮ A note on bipartite subgraphs and triangle-independent sets ⋮ Maximum bisections of graphs without cycles of length 4 ⋮ On judicious bipartitions of directed graphs ⋮ Three conjectures in extremal spectral graph theory ⋮ Bipartite subgraphs of integer weighted graphs ⋮ Large cuts with local algorithms on triangle-free graphs ⋮ Maximum directed cuts in graphs with degree constraints ⋮ Bounds for pairs in judicious partitioning of graphs ⋮ On bisections of graphs without complete bipartite graphs ⋮ MAX-CUT BY EXCLUDING BIPARTITE SUBGRAPHS ⋮ LARGE -FREE SUBGRAPHS IN -CHROMATIC GRAPHS ⋮ Inverting the Turán problem ⋮ Making an H $H$‐free graph k $k$‐colorable ⋮ 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 ⋮ Bisections of Graphs Without Short Cycles ⋮ Kernelization for cycle transversal problems ⋮ Optimal bisections of directed graphs ⋮ Judicious Partitioning of Hypergraphs with Edges of Size at Most 2 ⋮ Maximum cuts of graphs with forbidden cycles ⋮ The dual Cheeger constant and spectra of infinite graphs ⋮ A bound for judicious \(k\)-partitions of graphs ⋮ Lovász, Vectors, Graphs and Codes ⋮ Judicious partitions of 3-uniform hypergraphs ⋮ Maximum cuts in \(\mathscr{H} \)-free graphs ⋮ Maximum bisections of graphs without short even cycles ⋮ A proof of the stability of extremal graphs, Simonovits' stability from Szemerédi's regularity ⋮ Making a \(K_4\)-free graph bipartite ⋮ Dense induced bipartite subgraphs in triangle-free graphs ⋮ Max \(k\)-cut and judicious \(k\)-partitions ⋮ On judicious bipartitions of graphs ⋮ Inverting the Turán problem with chromatic number ⋮ Judicious \(k\)-partitions of graphs ⋮ MAXIMUM CUTS IN GRAPHS WITHOUT WHEELS ⋮ A bound on judicious bipartitions of directed graphs ⋮ BIPARTITE SUBGRAPHS OF -FREE GRAPHS ⋮ Approximability Distance in the Space of H-Colourability Problems ⋮ On a Problem of Judiciousk-Partitions of Graphs ⋮ Eigenvalues and triangles in 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 cuts: Improvements and local algorithmic analogues of the Edwards-Erdős inequality ⋮ On problems about judicious bipartitions of graphs ⋮ Maximum bipartite subgraphs in $H$-free graphs ⋮ On bisections of directed graphs
Cites Work
- Unnamed Item
- Probabilistic construction of deterministic algorithms: approximating packing integer programs
- Triangle-free partial graphs and edge covering theorems
- Explicit Ramsey graphs and orthonormal labelings
- A note on bipartite subgraphs of triangle‐free graphs
- Bipartite Subgraphs of Triangle-Free Graphs
- Some Extremal Properties of Bipartite Subgraphs
This page was built for publication: Bipartite subgraphs
