Hostname: page-component-78c5997874-dh8gc Total loading time: 0 Render date: 2024-11-08T15:30:48.514Z Has data issue: false hasContentIssue false
  • English
  • Français

Tournaments and Orders with the Pigeonhole Property

Published online by Cambridge University Press:  20 November 2018

Anthony Bonato ,
Peter Cameron  and
Dejan Delić
Anthony Bonato
Affiliation:
Department of Mathematics, Wilfrid Laurier University, Waterloo, ON, N2L 3C5, email: [email protected]
Peter Cameron
Affiliation:
School of Mathematical Sciences, Queen Mary and Westfield College, London E1 4NS, U.K., email: [email protected]
Dejan Delić
Affiliation:
Department of Mathematics and Statistics, McMaster University, Hamilton, ON, L8S 4K1, email: [email protected]
Rights & Permissions [Opens in a new window]

Abstract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the ‘Save PDF’ action button.

A binary structure $S$ has the pigeonhole property $\left( P \right)$ if every finite partition of $S$ induces a block isomorphic to $S$. We classify all countable tournaments with $\left( P \right)$; the class of orders with $\left( P \right)$ is completely classified.

Keywords

05C2003C15pigeonhole propertytournamentorder
Type
Research Article
Information
Canadian Mathematical Bulletin , Volume 43 , Issue 4 , 01 December 2000 , pp. 397 - 405
Copyright
Copyright © Canadian Mathematical Society 2000

References

[1] Bonato, A. and Delić, D., A pigeonhole principle for relational structures. Mathematical Logic Quarterly 45 (1999), 409–413.Google Scholar
[2] Cameron, P. J., Oligomorphic Permutation Groups. London Math. Soc. Lecture Notes 152, Cambridge University Press, Cambridge, 1990.Google Scholar
[3] Cameron, P. J., The random graph. In: Algorithms and Combinatorics, Springer Verlag, New York 14 (1997), 333–351.Google Scholar
[4] Rosenstein, J. G., Linear orderings, Academic Press, New York, 1982.Google Scholar