7 problems

Bang-Jensen and Yeo's conjecture. There exists an integer $K$ such that every $K$-arc-strong digraph has a strong arc decomposition.

Thomassen's conjecture. There exists an integer $K$ such that every $K$-arc-strong digraph $D=(V,A)$ has a good $(u,v)$-pair for every choice of $u,v\in V$.

Let $\mathcal H_2$ be the smallest class of digraphs containing symmetric odd cycles and closed under taking directed Hajós joins and $2$-Hajós tree joins. A digraph is $2$-extrema…

Bang-Jensen–Yeo's conjecture. There exists an integer $K$ such that every $K$-arc-strong digraph $D=(V,A)$ has an arc-partition

Arc-avoidance conjecture. The digraph $D\setminus A'$ is supereulerian.

Bang–Jensen–Thomassé's conjecture. Every digraph $D$ with $\lambda(D)\geq\alpha(D)$ is supereulerian.

Special-case conjecture. There exists a natural number $k$ such that every digraph $D$ which is both $k$-arc-strong and $k$-arc-antistrong has arc-disjoint strong spanning subdigra…