2$ and an integer $g$, we prove that there is a graph $G$ of girth at least $g$, which is uniquely $r$-colourable and uniquely $r'$-fractional colourable.'/>
Uniquely circular colourable and uniquely fractional colourable graphs of large girth
Given any rational numbers $r geq r' >2$ and an integer $g$, we prove that there is a graph $G$ of girth at least $g$, which is uniquely $r$-colourable and uniquely $r'$-fractional colourable.
展开▼
机译：给定任何有理数$ r geq r'> 2 $和整数$ g $，我们证明存在一个图$ G $的周长至少为$ g $，这是唯一的$ r $有色且唯一的$ r '-分数可着色。
展开▼
