Bipartite subgraphs of integer weighted graphs

DOI10.1016/S0012-365X(97)00041-1MaRDI QIDQ1381843zbMATH OpenFDO

Authors Noga Alon, Eran Halperin

Publication date 1 April 1998

Published in Discrete Mathematics (Search for Journal in Brave)

zbMATH Keywords

bipartite subgraphinteger-weighted graph

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35)

Recommendations

• Bipartite divisor graphs for integer subsets
• Bipartite subgraphs
• On Subgraphs of the Complete Bipartite Graph
• On bipartite graphs with weak density of some subgraphs
• Publication:4863503
• Bipartite Subgraphs of Triangle-Free Graphs
• Bipartite spanning sub(di)graphs induced by 2-partitions
• Bipartite subgraphs of triangle-free subcubic graphs
• Bipartite subgraphs of \(H\)-free graphs
• scientific article; zbMATH DE number 4053666

Cites work

• scientific article; zbMATH DE number 3510345 (Why is no real title available?)
• Bipartite subgraphs
• Some Extremal Properties of Bipartite Subgraphs

Cited in

(27)

• Maximum bisections of graphs without short even cycles
• Maximum bipartite subgraphs in $H$-free graphs
• Problems and results on judicious partitions
• On judicious partitions of uniform hypergraphs
• Bipartite subgraphs of \(H\)-free graphs
• Minimum weight \(H\)-decompositions of graphs: the bipartite case
• BIPARTITE DIVISOR GRAPH FOR THE PRODUCT OF SUBSETS OF INTEGERS
• Max \(k\)-cut and judicious \(k\)-partitions
• Judicious partitions of uniform hypergraphs
• Judicious partitions of bounded‐degree graphs
• Hypergraph cuts above the average
• Inverting the Turán problem
• On a problem of Ahlswede and Katona
• Maximum cuts of graphs with forbidden cycles
• Judicious \(k\)-partitions of graphs
• Maximum cuts and judicious partitions in graphs without short cycles
• The Bollobás-Thomason conjecture for \(3\)-uniform hypergraphs
• Maximum bisections of graphs without cycles of length 4
• On judicious bipartitions of graphs
• On bipartite graphs with weak density of some subgraphs
• Maximum cuts in graphs without wheels
• Lower Bounds for Maximum Weighted Cut
• Inverting the Turán problem with chromatic number
• On bisections of directed graphs
• Lower bounds for max-cut in \(H\)-free graphs via semidefinite programming
• Maximum bipartite subgraphs in graphs without short cycles
• Making an H $H$‐free graph k $k$‐colorable

This page was built for publication: Bipartite subgraphs of integer weighted graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1381843)