List your company

A Census of Non-Reconstructable Digraphs, II: A Family of Tournaments

About

Continuing the program begun in the first paper of this series, we present a pair of non-reconstructable tournament on $p$ vertices for each $p=2^n \ge 4$.

Related benchmarks

No related benchmarks have been indexed for this paper yet.