← All problems

Asymptotic scarcity conjecture for self-converse digraphs

19 years old · traced to

Let SCn\mathcal{SC}_n be the number of self-converse digraphs on nn vertices, and let Dn\mathcal{D}_n be the number of digraphs on nn vertices. Asymptotic scarcity conjecture.

SCnDn→0 as n→∞.\frac{\mathcal{SC}_n}{\mathcal{D}_n} \to 0 \text{ as } n\to\infty.

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

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.

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).

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.