A Census of Non-Reconstructable Digraphs, II: A Family of Tournaments
Combinatorics
2021-10-13 v1
Abstract
Continuing the program begun in the first paper of this series, we present a pair of non-reconstructable tournament on vertices for each .
Cite
@article{arxiv.2110.06158,
title = {A Census of Non-Reconstructable Digraphs, II: A Family of Tournaments},
author = {Paul K. Stockmeyer},
journal= {arXiv preprint arXiv:2110.06158},
year = {2021}
}