2 problems

Let $q_G(x)$ denote the interlace polynomial of a graph $G$. There are constants $c_1,c_2,\ldots$ with … such that, for every $k\geq 1$ and all sufficiently large $n$, there are gr…

LC-orbit minimum-degree conjecture. Then there is no graph on $n$ vertices whose minimum vertex degree among all graphs in its LC orbit is greater than $\delta$. The statement prop…