The following pages link to How to make a graph bipartite (Q805628):
Displaying 21 items.
- The clique number and the smallest \(Q\)-eigenvalue of graphs (Q267202) (← links)
- Cycle-maximal triangle-free graphs (Q472981) (← links)
- 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)
- Dense induced bipartite subgraphs in triangle-free graphs (Q2003768) (← links)
- On the power of random greedy algorithms (Q2145759) (← links)
- extremal aspects of the Erdős-Gallai-Tuza conjecture (Q2342626) (← links)
- A note on bipartite subgraphs and triangle-independent sets (Q2374154) (← links)
- Sparse halves in triangle-free graphs (Q2496210) (← links)
- On a Conjecture of Erdős, Gallai, and Tuza (Q2947853) (← links)
- More about sparse halves in triangle-free graphs (Q3391027) (← links)
- Problems and results on judicious partitions (Q4798176) (← links)
- Exact stability for Turán’s Theorem (Q5028504) (← links)
- Sparse halves in K4‐free graphs (Q6056789) (← links)
- Bounds on Ramsey games via alterations (Q6081572) (← links)
- The Spectrum of Triangle-Free Graphs (Q6157996) (← links)
