# Thomas, Robin

## Does every subcubic triangle-free graph have fractional chromatic number at most 14/5? ★

**Conjecture**Every triangle-free graph with maximum degree at most 3 has fractional chromatic number at most 14/5.

Keywords: fractional coloring

## Highly connected graphs with no K_n minor ★★★

Author(s): Thomas

**Problem**Is it true for all , that every sufficiently large -connected graph without a minor has a set of vertices whose deletion results in a planar graph?

Keywords: connectivity; minor