 |
|
Tournaments and Orders with the Pigeonhole Property |
Published:2000-12-01
Printed: Dec 2000
Printed: Dec 2000
- Anthony Bonato
- Peter Cameron
- Dejan Delić
Abstract
A binary structure $S$ has the pigeonhole property ($\mathcal{P}$) if
every finite partition of $S$ induces a block isomorphic to $S$. We
classify all countable tournaments with ($\mathcal{P}$); the class of
orders with ($\mathcal{P}$) is completely classified.
| Keywords: | pigeonhole property, tournament, order |
| MSC Classifications: |
05C20 - Directed graphs (digraphs), tournaments 03C15 - Denumerable structures |