Some Extremal Properties of Bipartite Subgraphs
From MaRDI portal
Publication:5668830
DOI10.4153/CJM-1973-048-XzbMath0254.05116OpenAlexW2038562737WikidataQ94994237 ScholiaQ94994237MaRDI QIDQ5668830
Publication date: 1973
Published in: Canadian Journal of Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.4153/cjm-1973-048-x
Related Items (95)
On judicious partitions of uniform hypergraphs ⋮ On judicious partitions of graphs ⋮ The Crossing Number of the Cone of a Graph ⋮ Maximum directed cuts in acyclic digraphs ⋮ Judicious partitions of weighted hypergraphs ⋮ Problems and results on judicious partitions ⋮ Biased partitions and judicious \(k\)-partitions of graphs ⋮ Maximum bisections of graphs without cycles of length 4 ⋮ On judicious bipartitions of directed graphs ⋮ Judicious partitions of hypergraphs ⋮ Judicious partitions of directed graphs ⋮ Linear-Time Approximation Algorithms for the Max Cut Problem ⋮ Largest bipartite subgraphs in triangle-free graphs with maximum degree three ⋮ The size of the largest bipartite subgraphs ⋮ On several partitioning problems of Bollobás and Scott ⋮ Bipartite subgraphs of integer weighted graphs ⋮ Note on maximal bisection above tight lower bound ⋮ The bipartite edge frustration of composite graphs ⋮ Maximum directed cuts in graphs with degree constraints ⋮ Bounds for pairs in judicious partitioning of graphs ⋮ Partitioning digraphs with outdegree at least 4 ⋮ On bisections of graphs without complete bipartite graphs ⋮ On judicious bisections of graphs ⋮ A survey of graph laplacians ⋮ MAX-CUT BY EXCLUDING BIPARTITE SUBGRAPHS ⋮ Making an H $H$‐free graph k $k$‐colorable ⋮ Upper bounds on minimum balanced bipartitions ⋮ Graph partitioning: an updated survey ⋮ On a bipartition problem of Bollobás and Scott ⋮ Maximum cuts and judicious partitions in graphs without short cycles ⋮ New results for MaxCut in H$H$‐free graphs ⋮ The Crossing Number of the Cone of a Graph ⋮ Bisections of Graphs Without Short Cycles ⋮ Partitioning dense uniform hypergraphs ⋮ Kalai's conjecture in \(r\)-partite \(r\)-graphs ⋮ Optimal bisections of directed graphs ⋮ The Bollobás--Scott Conjecture for 4-Uniform Hypergraphs ⋮ Judicious Partitioning of Hypergraphs with Edges of Size at Most 2 ⋮ Maximum cuts of graphs with forbidden cycles ⋮ Study of the Bipartite Edge Frustration of Graphs ⋮ On bipartite restrictions of binary matroids ⋮ The bipartite edge frustration of graphs under subdivided edges and their related sums ⋮ Bisections of graphs ⋮ Extremal properties of the bipartite vertex frustration of graphs ⋮ Cutting two graphs simultaneously ⋮ Balanced Judicious Bipartition is Fixed-Parameter Tractable ⋮ Beyond Max-Cut: \(\lambda\)-extendible properties parameterized above the Poljak-Turzík bound ⋮ 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 ⋮ \textsc{Max-Cut} parameterized above the Edwards-Erdős bound ⋮ Partitioning posets ⋮ An improved kernel for max-bisection above tight lower bound ⋮ Making a \(K_4\)-free graph bipartite ⋮ On existence theorems ⋮ Dense induced bipartite subgraphs in triangle-free graphs ⋮ The cut cone. III: On the role of triangle facets ⋮ Parameterized Traveling Salesman Problem: Beating the Average ⋮ On bipartitions of directed graphs with small semidegree ⋮ A note on balanced bipartitions ⋮ The cut cone. III: On the role of triangle facets ⋮ Bounds for pairs in partitions of graphs ⋮ Max \(k\)-cut and judicious \(k\)-partitions ⋮ Balanced judicious bipartitions of graphs ⋮ The bipartite edge frustration of extension of splice and link graphs ⋮ On judicious bipartitions of graphs ⋮ Max-bisections of \(H\)-free graphs ⋮ Linear kernels and linear-time algorithms for finding large cuts ⋮ Bipartitions of oriented graphs ⋮ Better Bounds for k-Partitions of Graphs ⋮ Judicious \(k\)-partitions of graphs ⋮ On partitions of \(K_{2, 3}\)-free graphs under degree constraints ⋮ Maximum bipartite subgraphs of cubic triangle-free planar graphs ⋮ Fixed-parameter tractable algorithm and polynomial kernel for \textsc{Max-Cut Above Spanning Tree} ⋮ A bound on judicious bipartitions of directed graphs ⋮ Algorithms for the maximum satisfiability problem ⋮ On a Problem of Judiciousk-Partitions of Graphs ⋮ Judicious partitions of bounded‐degree graphs ⋮ Balanced Judicious Bipartition is Fixed-Parameter Tractable ⋮ Maximum bipartite subgraphs in graphs without short cycles ⋮ Bipartite subgraphs ⋮ Hypergraph cuts above the average ⋮ Eigenvector-based identification of bipartite subgraphs ⋮ On the chromatic number of Steiner triple systems of order 25 ⋮ 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 ⋮ Acyclic Digraphs ⋮ Maximumk-colorable subgraphs ⋮ On problems about judicious bipartitions of graphs ⋮ Judicious partitions of graphs ⋮ Maximum bipartite subgraphs in $H$-free graphs ⋮ A polynomial time heuristic for certain subgraph optimization problems with guaranteed worst case bound ⋮ On bisections of directed graphs
This page was built for publication: Some Extremal Properties of Bipartite Subgraphs
