The following pages link to How to make a graph bipartite (Q805628):
Displayed 12 items.
- On set systems with a threshold property (Q856857) (← links)
- Pentagons vs. triangles (Q941370) (← links)
- Making a \(K_4\)-free graph bipartite (Q950329) (← links)
- Judicious partitions of graphs (Q1314903) (← links)
- Judicious partitions of hypergraphs (Q1356017) (← links)
- The local density of triangle-free graphs (Q1382812) (← links)
- Judicious partitions of 3-uniform hypergraphs (Q1972352) (← links)
- Sparse halves in triangle-free graphs (Q2496210) (← links)
- A note on bipartite subgraphs of triangle‐free graphs (Q3990224) (← links)
- SOME OF MY FAVORITE SOLVED AND UNSOLVED PROBLEMS IN GRAPH THEORY (Q4288049) (← links)
- Linear-Time Approximation Algorithms for the Max Cut Problem (Q4290088) (← links)
- Problems and results on judicious partitions (Q4798176) (← links)