A Census of Non-Reconstructable Digraphs, II: A Family of Tournaments
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=2n 4.
0
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.