The following pages link to On even subgraphs of graphs (Q5588434):
Displaying 24 items.
- A proof of the stability of extremal graphs, Simonovits' stability from Szemerédi's regularity (Q490983) (← links)
- \textsc{Max-Cut} parameterized above the Edwards-Erdős bound (Q494801) (← links)
- On hypergraphs having evenly distributed subhypergraphs (Q686453) (← links)
- On existence theorems (Q686508) (← links)
- On finite set-systems whose every intersection is a kernel of a star (Q787982) (← links)
- How to make a graph bipartite (Q805628) (← links)
- Making a \(K_4\)-free graph bipartite (Q950329) (← links)
- The bipartite edge frustration of extension of splice and link graphs (Q988725) (← links)
- Maximum bipartite subgraphs of cubic triangle-free planar graphs (Q1011782) (← links)
- Implications of forbidden structures for extremal algorithmic problems (Q1082812) (← links)
- Maximum cuts: Improvements and local algorithmic analogues of the Edwards-Erdős inequality (Q1297468) (← links)
- Judicious partitions of hypergraphs (Q1356017) (← links)
- The NP-completeness of (1,r)-subcolorability of cubic graphs (Q1603517) (← links)
- Odd subgraphs and matchings (Q1613457) (← links)
- On subgraphs of \(C_{2k}\)-free graphs (Q1689968) (← links)
- Strong forms of stability from flag algebra calculations (Q1719577) (← links)
- On bipartitions of directed graphs with small semidegree (Q2011152) (← links)
- Techniques and results on approximation algorithms for packing circles (Q2082050) (← links)
- Maximum bisections of graphs without cycles of length 4 (Q2142653) (← links)
- The Crossing Number of the Cone of a Graph (Q4579956) (← links)
- Lower Bounds for Max-Cut in $H$-Free Graphs via Semidefinite Programming (Q5001844) (← links)
- MAX-CUT BY EXCLUDING BIPARTITE SUBGRAPHS (Q6082046) (← links)
- New results for MaxCut in H$H$‐free graphs (Q6134889) (← links)
- Maximum bisections of graphs without cycles of length four and five (Q6648263) (← links)
