Pages that link to "Item:Q3990224"

The following pages link to A note on bipartite subgraphs of triangle‐free graphs (Q3990224):

Displaying 31 items.

• Cleaning with brooms (Q659685) (← links)
• Cleaning random \(d\)-regular graphs with brooms (Q659724) (← links)
• Making a \(K_4\)-free graph bipartite (Q950329) (← links)
• Maximum cuts: Improvements and local algorithmic analogues of the Edwards-Erdős inequality (Q1297468) (← links)
• Regular honest graphs, isoperimetric numbers, and bisection of weighted graphs (Q1306928) (← links)
• Judicious partitions of graphs (Q1314903) (← links)
• Maximum cuts and judicious partitions in graphs without short cycles (Q1400968) (← links)
• Dense induced bipartite subgraphs in triangle-free graphs (Q2003768) (← links)
• Maximum bipartite subgraphs in graphs without short cycles (Q2078834) (← links)
• Maximum bisections of graphs without cycles of length 4 (Q2142653) (← links)
• Maximum cuts in \(\mathscr{H} \)-free graphs (Q2227990) (← links)
• Maximum bisections of graphs without short even cycles (Q2229167) (← links)
• Hypergraph cuts above the average (Q2327966) (← links)
• Bounds on the bisection width for random \(d\)-regular graphs (Q2381523) (← links)
• Large cuts with local algorithms on triangle-free graphs (Q2411507) (← links)
• Bipartite subgraphs (Q2563506) (← links)
• Lovász, Vectors, Graphs and Codes (Q3295262) (← links)
• Linear-Time Approximation Algorithms for the Max Cut Problem (Q4290088) (← links)
• Maximum cuts of graphs with forbidden cycles (Q4615059) (← links)
• Problems and results on judicious partitions (Q4798176) (← links)
• MAXIMUM CUTS IN GRAPHS WITHOUT WHEELS (Q4968449) (← links)
• BIPARTITE SUBGRAPHS OF -FREE GRAPHS (Q4975587) (← links)
• Lower Bounds for Max-Cut in $H$-Free Graphs via Semidefinite Programming (Q5001844) (← links)
• Maximum bipartite subgraphs in $H$-free graphs (Q5867125) (← links)
• Local approximation of the maximum cut in regular graphs (Q5918122) (← links)
• MAX-CUT BY EXCLUDING BIPARTITE SUBGRAPHS (Q6082046) (← links)
• Lower Bounds for Maximum Weighted Cut (Q6100613) (← links)
• New results for MaxCut in H$H$‐free graphs (Q6134889) (← links)
• The Spectrum of Triangle-Free Graphs (Q6157996) (← links)
• Maximum bisections of graphs with girth at least six (Q6640955) (← links)
• Maximum bisections of graphs without cycles of length four and five (Q6648263) (← links)