Manoussakis's pancyclicity conjecture for digraphs
Let be a strongly connected digraph on vertices. For vertices , say that is nonadjacent to when neither arc between them is present. A digraph is pancyclic if it contains directed cycles of every length allowed by the conjecture.
Manoussakis's conjecture. If, for every triple with nonadjacent to , the inequalities
when , and
when , hold, then is pancyclic.
This is a proposed pancyclic analogue of Manoussakis-type Hamiltonicity degree conditions.
References
Status
- Solved: Andrzej Adamus. On a conjecture of Manoussakis (Discrete Mathematics 339(2), 667–672, 2016) https://api.crossref.org/works?query.bibliographic=On%20a%20conjecture%20of%20Manoussakis%20Andrzej%20Adamus&rows=1
Source: Bo Ning, “Notes on a conjecture of Manoussakis concerning Hamilton cycles in digraphs”, arXiv:1404.5013 (2014).
Progress summary
Never refreshed
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Solutions 0
No solutions have been posted yet.