TY - JOUR
T1 - Generalized pigeonhole properties of graphs and oriented graphs
AU - Bonato, Anthony
AU - Cameron, Peter J.
AU - Delić, Dejan
AU - Thomassé, Stéphan
PY - 2002/1/1
Y1 - 2002/1/1
N2 - A relational structure A satisfies the P(n, k) property if whenever the vertex set of A is partitioned into n nonempty parts, the substructure induced by the union of some k of the parts is isomorphic to A. The P(2, 1) property is just the pigeonhole property, (P), introduced by Cameron, and studied by Bonato, Delić and Cameron. We classify the countable graphs, tournaments, and oriented graphs with the P(3, 2) property.
AB - A relational structure A satisfies the P(n, k) property if whenever the vertex set of A is partitioned into n nonempty parts, the substructure induced by the union of some k of the parts is isomorphic to A. The P(2, 1) property is just the pigeonhole property, (P), introduced by Cameron, and studied by Bonato, Delić and Cameron. We classify the countable graphs, tournaments, and oriented graphs with the P(3, 2) property.
UR - http://www.scopus.com/inward/record.url?scp=0036083941&partnerID=8YFLogxK
U2 - 10.1006/eujc.2002.0574
DO - 10.1006/eujc.2002.0574
M3 - Article
AN - SCOPUS:0036083941
SN - 0195-6698
VL - 23
SP - 257
EP - 274
JO - European Journal of Combinatorics
JF - European Journal of Combinatorics
IS - 3
ER -