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

2021/10/12 by Paul K. Stockmeyer, Stockmeyer, Paul K.
Economics, Econometrics and Finance · #Game Theory and Voting Systems

paper · pdf · doi:10.48550/arxiv.2110.06158

Abstract

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ⁿ ≥ 4.

Cited by

• Reconstruction of small graphs and digraphs

Related

• Reconstruction of small graphs and digraphs
• Inducibility of 4-vertex tournaments
• Topological Tournaments
• The Removal Lemma for Tournaments
• Subdivisions of digraphs in tournaments