The following pages link to (Q4550236):
Displaying 45 items.
- On judicious partitions of uniform hypergraphs (Q272317) (← links)
- On judicious partitions of graphs (Q281768) (← links)
- On judicious bisections of graphs (Q402590) (← links)
- Upper bounds on minimum balanced bipartitions (Q409437) (← links)
- A bound for judicious \(k\)-partitions of graphs (Q477337) (← links)
- Judicious partitions of uniform hypergraphs (Q484549) (← links)
- \textsc{Max-Cut} parameterized above the Edwards-Erdős bound (Q494801) (← links)
- On several partitioning problems of Bollobás and Scott (Q602718) (← links)
- A note on balanced bipartitions (Q709305) (← links)
- Linear kernels and linear-time algorithms for finding large cuts (Q722541) (← 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 and judicious partitions in graphs without short cycles (Q1400968) (← links)
- Note on maximal bisection above tight lower bound (Q1675768) (← links)
- An improved kernel for max-bisection above tight lower bound (Q1985605) (← links)
- Dense induced bipartite subgraphs in triangle-free graphs (Q2003768) (← links)
- Maximum bipartite subgraphs in graphs without short cycles (Q2078834) (← links)
- On judicious bipartitions of directed graphs (Q2144584) (← links)
- Maximum bisections of graphs without short even cycles (Q2229167) (← links)
- Hypergraph cuts above the average (Q2327966) (← links)
- On problems about judicious bipartitions of graphs (Q2338639) (← links)
- On bisections of directed graphs (Q2357220) (← links)
- Three conjectures in extremal spectral graph theory (Q2399353) (← links)
- Inverting the Turán problem (Q2421851) (← links)
- Beyond Max-Cut: \(\lambda\)-extendible properties parameterized above the Poljak-Turzík bound (Q2453557) (← links)
- The Bollobás-Thomason conjecture for \(3\)-uniform hypergraphs (Q2454588) (← links)
- Biased partitions and judicious \(k\)-partitions of graphs (Q2627880) (← links)
- Satisfying more than half of a system of linear equations over GF(2): a multivariate approach (Q2637641) (← links)
- On a Conjecture of Erdős, Gallai, and Tuza (Q2947853) (← links)
- Bounds for pairs in judicious partitioning of graphs (Q2951883) (← links)
- The Crossing Number of the Cone of a Graph (Q2961536) (← links)
- Judicious partitions of bounded‐degree graphs (Q4474279) (← links)
- The Crossing Number of the Cone of a Graph (Q4579956) (← links)
- Bisections of Graphs Without Short Cycles (Q4601051) (← links)
- The Bollobás--Scott Conjecture for 4-Uniform Hypergraphs (Q4605442) (← links)
- Maximum cuts of graphs with forbidden cycles (Q4615059) (← 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)
- Lower Bounds for Max-Cut in $H$-Free Graphs via Semidefinite Programming (Q5001844) (← links)
- Maximum bipartite subgraphs in $H$-free graphs (Q5867125) (← links)
- On judicious bipartitions of graphs (Q5915867) (← links)
- Making an H $H$‐free graph k $k$‐colorable (Q6093148) (← links)
- Lower Bounds for Maximum Weighted Cut (Q6100613) (← links)
