2 problems

A semi-complete digraph is a digraph in which every pair of distinct vertices is joined by at least one directed arc. Semi-complete-digraph finiteness conjecture. For every…

Let $D$ be a 3-dicritical digraph on $n$ vertices, and let $m(D)$ denote its number of arcs. Dense 3-dicritical finiteness conjecture. There are only finitely many 3-dicritical dig…