Generalized pigeonhole properties of graphs and oriented graphs

DOI10.1006/EUJC.2002.0574zbMath1002.05059OpenAlexW1980496272MaRDI QIDQ1612756

Anthony Bonato, Dejan Delić, Peter J. Cameron, Steéphan Thomassé

Publication date: 5 January 2003

Published in: European Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1006/eujc.2002.0574

zbMATH Keywords

oriented graphtournamentlinear ordercountable graphgeneralized pigeonhole property

Mathematics Subject Classification ID

Structural characterization of families of graphs (05C75) Directed graphs (digraphs), tournaments (05C20)

Related Items (2)

Splittings and Ramsey properties of permutation classes ⋮ Partitions and orientations of the Rado graph

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Theory of relations. Transl. from the French by P. Clote
• Ramsey-type properties of relational structures
• Indivisibility and alpha-morphisms
• Inexhaustible homogeneous structures
• A Pigeonhole Property for Relational Structures
• Tournaments and Orders with the Pigeonhole Property
• The random graph
• On an adjacency property of almost all graphs

This page was built for publication: Generalized pigeonhole properties of graphs and oriented graphs