We have 3 of 43 papers
We haven’t gathered this author’s papers yet. Follow them and we’ll fetch their work.
Not the right person? Other researchers publish under this name.
We exhibit a cubic graph with total chromatic number equal to four and list total chromatic number five. This disproves the List Total Colouring Conjecture of Borodin--Kostochka--Woodall, Juvan--Mohar--\v{S}krekovski and Hilton--Johnson from the late 1990s. ChatGPT 6 Astra Ultra discovered the counterexample with littl...
We exhibit a graph $G$ with $14$ vertices and list chromatic number equal to $3$ such that there is a $2$-list assignment $L$ of $G$ such that at most $9$ vertices of $G$ can be properly coloured from $L$. This disproves the Partial List Colouring Conjecture of Albertson, Grossman and Haas. This counterexample was disc...
Martinsson and Steiner recently proved that the fractional chromatic number of any $d$-degenerate triangle-free graph $G$ satisfies $\chi_f(G) = O\left(\frac{d}{\log d}\right)$. They further conjectured a sharp leading constant $1 + o(1)$. In this paper, we confirm their upper bound conjecture for graphs having girth a...
We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.
