MathDB1 problem
- 0 votes0 replies0 views
Finiteness conjecture for k-dicritical semi-complete digraphs
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…