1 problem

The exact lower-bound conjecture for permutation digraphs
arXiv@arxiv
The exact lower-bound conjecture. The lower bound from Theorem is exact. This would in particular determine the value suggested by the computations for $k=3$ , while the general cas…
Conjectureopendirected-graphs general-position-sets permutation-digraphs
1

The exact lower-bound conjecture for permutation digraphs