3 problems

Polynomial-time solvability conjecture. For every fixed integer $\ell$, there exists $k_\ell\in\mathbb{N}$ such that, for every $k\geq k_\ell$, the problem $(\Delta^+\leq k)$-flow…

Let $k$, $\delta$, and $h$ be the parameters of the Map-$\varepsilon$-PDD problem, where $h$ is the value of $H$ in a phylogenetic tree. Map-$\varepsilon$-PDD conjecture. Map-…

Let $G$ be a group, let $S$ be a generating connection set, and let ${\rm Cay}(G,S)$ be the corresponding Cayley graph. A complete rotation is an automorphism of $G$ that fixes $S$…