Tournaments and Orders with the Pigeonhole Property

DOI10.4153/CMB-2000-047-6zbMath0970.06003OpenAlexW2046274682MaRDI QIDQ4761342

Peter J. Cameron, Anthony Bonato, Dejan Delić

Publication date: 16 October 2001

Published in: Canadian Mathematical Bulletin (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.4153/cmb-2000-047-6

zbMATH Keywords

posetsquasi-ordersinfinite antichainpigeonhole propertyclassification of binary structurescountable tournamentspogroupoid representation

Mathematics Subject Classification ID

Combinatorics of partially ordered sets (06A07) Directed graphs (digraphs), tournaments (05C20) Model theory of denumerable and separable structures (03C15)

Related Items (7)

Generalized pigeonhole properties of graphs and oriented graphs ⋮ A note on orientations of the infinite random graph ⋮ Indivisible sets and well‐founded orientations of the Rado graph ⋮ ON PRODUCTS OF ELEMENTARILY INDIVISIBLE STRUCTURES ⋮ Spanning subgraphs of graphs partitioned into two isomorphic pieces ⋮ Partitions and orientations of the Rado graph ⋮ Ramsey theory for countable binary homogeneous structures

This page was built for publication: Tournaments and Orders with the Pigeonhole Property