login/create account
Andrew King
| Type | Post | Author | Replies | Last post |
|---|---|---|---|---|
| Open problem | Does every subcubic triangle-free graph have fractional chromatic number at most 14/5? | Andrew King | 1 | 6 years 20 weeks ago |
| Open problem | The Borodin-Kostochka Conjecture | Andrew King | 0 | 6 years 45 weeks ago |
| Open problem | Cycle double cover conjecture | mdevos | 3 | 7 years 23 weeks ago |
| Open problem | The Berge-Fulkerson conjecture | mdevos | 9 | 7 years 34 weeks ago |
| Open problem | Obstacle number of planar graphs | Andrew King | 0 | 7 years 34 weeks ago |
| Open problem | Covering powers of cycles with equivalence subgraphs | Andrew King | 0 | 8 years 2 weeks ago |
| Open problem | Hitting every large maximal clique with a stable set | Andrew King | 0 | 8 years 16 weeks ago |
| Open problem | Exponentially many perfect matchings in cubic graphs | mdevos | 2 | 8 years 31 weeks ago |
| Open problem | Strong colorability | berger | 5 | 9 years 35 weeks ago |
| Open problem | Bounding the chromatic number of triangle-free graphs with fixed maximum degree | Andrew King | 0 | 10 years 13 weeks ago |
Drupal
CSI of Charles University