The following pages link to Bipartite subgraphs (Q2563506):
Displaying 50 items.
- On judicious partitions of uniform hypergraphs (Q272317) (← links)
- Kernelization for cycle transversal problems (Q423937) (← links)
- A bound for judicious \(k\)-partitions of graphs (Q477337) (← links)
- A proof of the stability of extremal graphs, Simonovits' stability from Szemerédi's regularity (Q490983) (← links)
- Making a \(K_4\)-free graph bipartite (Q950329) (← links)
- Max \(k\)-cut and judicious \(k\)-partitions (Q982619) (← links)
- Judicious \(k\)-partitions of graphs (Q1003836) (← links)
- Maximum cuts: Improvements and local algorithmic analogues of the Edwards-Erdős inequality (Q1297468) (← links)
- Bipartite subgraphs of integer weighted graphs (Q1381843) (← links)
- Maximum cuts and judicious partitions in graphs without short cycles (Q1400968) (← links)
- Maximum directed cuts in graphs with degree constraints (Q1926032) (← links)
- Judicious partitions of 3-uniform hypergraphs (Q1972352) (← links)
- Dense induced bipartite subgraphs in triangle-free graphs (Q2003768) (← links)
- Inverting the Turán problem with chromatic number (Q2037594) (← links)
- Maximum bipartite subgraphs in graphs without short cycles (Q2078834) (← links)
- Maximum bisections of graphs without cycles of length 4 (Q2142653) (← links)
- On judicious bipartitions of directed graphs (Q2144584) (← links)
- Maximum cuts in \(\mathscr{H} \)-free graphs (Q2227990) (← links)
- Maximum bisections of graphs without short even cycles (Q2229167) (← links)
- Sums, products, and ratios along the edges of a graph (Q2302174) (← links)
- A bound on judicious bipartitions of directed graphs (Q2303909) (← links)
- Hypergraph cuts above the average (Q2327966) (← links)
- On problems about judicious bipartitions of graphs (Q2338639) (← links)
- On bisections of directed graphs (Q2357220) (← links)
- A note on bipartite subgraphs and triangle-independent sets (Q2374154) (← links)
- Three conjectures in extremal spectral graph theory (Q2399353) (← links)
- Large cuts with local algorithms on triangle-free graphs (Q2411507) (← links)
- Inverting the Turán problem (Q2421851) (← links)
- The dual Cheeger constant and spectra of infinite graphs (Q2445372) (← links)
- Degree Ramsey Numbers of Graphs (Q2883865) (← links)
- Bounds for pairs in judicious partitioning of graphs (Q2951883) (← links)
- Dense Graphs With a Large Triangle Cover Have a Large Triangle Packing (Q3168450) (← links)
- Lovász, Vectors, Graphs and Codes (Q3295262) (← links)
- Approximability Distance in the Space of H-Colourability Problems (Q3392945) (← links)
- Bisections of Graphs Without Short Cycles (Q4601051) (← 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)
- On a Problem of Judicious<i>k</i>-Partitions of Graphs (Q4978292) (← links)
- Eigenvalues and triangles in graphs (Q4993261) (← links)
- Lower Bounds for Max-Cut in $H$-Free Graphs via Semidefinite Programming (Q5001844) (← links)
- Judicious Partitioning of Hypergraphs with Edges of Size at Most 2 (Q5366944) (← links)
- Maximum bipartite subgraphs in $H$-free graphs (Q5867125) (← links)
- On judicious bipartitions of graphs (Q5915867) (← links)
- On bisections of graphs without complete bipartite graphs (Q6056762) (← links)
- MAX-CUT BY EXCLUDING BIPARTITE SUBGRAPHS (Q6082046) (← links)
- LARGE -FREE SUBGRAPHS IN -CHROMATIC GRAPHS (Q6082048) (← links)
- Making an H $H$‐free graph k $k$‐colorable (Q6093148) (← links)
- Lower Bounds for Maximum Weighted Cut (Q6100613) (← links)
