Embedded antichains in tournaments |
| |
| Affiliation: | 1. Edward J. Bloustein School of Planning and Public Policy, Rutgers University, New Brunswick, NJ, USA;4. Lafayette College, Easton, PA, USA;5. U.S. Fund for UNICEF, New York, NY, USA |
| |
| Abstract: | The maximum antichain cardinality (MACC) of a tournament is the maximum number of incomparable subtournaments of T. We establish some properties of MACC. We describe all tournaments whose MACC is 1 or 2, show that MACC can grow exponentially with the size of the vertex set of a tournament, and present some questions for further investigation. |
| |
| Keywords: | |
| 本文献已被 ScienceDirect 等数据库收录！ |
|
