The Reconstruction Conjecture for Tournaments is False.
Abstract
The conjecture that for all sufficiently large p any tournament of order p is uniquely reconstructable from its point-deleted subtournaments is shown to be false. Counterexamples are presented for all orders of the form (2 sup n) + 1 and (2 sup n) +2. The largest previously known counterexamples were of order eight.
Document Details
- Document Type
- Technical Report
- Publication Date
- Aug 01, 1975
- Accession Number
- ADA014436
Entities
People
- Paul K. Stockmeyer
Organizations
- College of William & Mary