2 problems

0 votes0 replies0 views
Beaudou–Foucaud–Naserasr conjecture on optimal fractional and circular bounds
Let $k$ be a positive integer. A graph $H$ of odd-girth $2k+1$ bounds a class of graphs if every graph in that class admits a graph homomorphism to $H$ . Consider the class of $K_4$ …
Conjectureopencircular-colouring fractional-colouring graph-homomorphismsarXiv posted 2 days ago
0 votes0 replies0 views
The minimum-cycle conjecture for non-b $k$ d-colourable graphs
Minimum-cycle conjecture. If $\chi(G)>k$ , then $G$ contains at least
Conjectureopencircular-colouring cycle-counting graph-colouringarXiv posted 2 days ago

Beaudou–Foucaud–Naserasr conjecture on optimal fractional and circular bounds