The size of the largest bipartite subgraphs

DOI10.1016/S0012-365X(97)00004-6zbMath0888.05035OpenAlexW2002958365WikidataQ105815733 ScholiaQ105815733MaRDI QIDQ1377883

András Gyárfás, Yoshiharu Kohayakawa

Publication date: 13 May 1998

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0012-365x(97)00004-6

zbMATH Keywords

bipartite subgraph

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35)

Related Items (19)

Maximum bisections of graphs without cycles of length 4 ⋮ Satisfying more than half of a system of linear equations over GF(2): a multivariate approach ⋮ Judicious partitions of directed graphs ⋮ MAX-CUT BY EXCLUDING BIPARTITE SUBGRAPHS ⋮ Graph partitioning: an updated survey ⋮ Bisections of Graphs Without Short Cycles ⋮ Approximating sparse quadratic programs ⋮ On bipartite restrictions of binary matroids ⋮ Bisections of graphs ⋮ Judicious partitions of 3-uniform hypergraphs ⋮ Maximum bisections of graphs without short even cycles ⋮ Bisections of graphs without \(K_{2, l}\) ⋮ \textsc{Max-Cut} parameterized above the Edwards-Erdős bound ⋮ On bipartitions of directed graphs with small semidegree ⋮ Max-bisections of \(H\)-free graphs ⋮ MAXIMUM CUTS IN GRAPHS WITHOUT WHEELS ⋮ BIPARTITE SUBGRAPHS OF -FREE GRAPHS ⋮ Hypergraph cuts above the average ⋮ Maximum bipartite subgraphs in $H$-free graphs

Cites Work

• On some extremal problems in graph theory
• On coloring graphs to maximize the proportion of multicolored k-edges
• Some Extremal Properties of Bipartite Subgraphs
• Unnamed Item

This page was built for publication: The size of the largest bipartite subgraphs