Asymptotic scarcity conjecture for self-converse digraphs
Let be the number of self-converse digraphs on vertices, and let be the number of digraphs on vertices. Asymptotic scarcity conjecture.
The claim gives numerical evidence for the scarcity of self-converse digraphs, which are necessary for digraphs that are strongly determined by the Hermitian spectrum. The source provides numerical evidence rather than a proof, so the asymptotic assertion remains open.
References
Primary source
Pepijn Wissing and Edwin R. van Dam, “The negative tetrahedron and the first infinite family of connected digraphs that are strongly determined by the Hermitian spectrum”, arXiv:1903.09531 (2020).
Additional references
2 papers in this index state this conjecture (2007–2019). The statement above is taken from the most recent of them; the others are arXiv:0704.0918.
Progress summary
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.