activity
20052020
most citedInvariant subsets of scattered trees. An application to the tree alternative property of Bonato and Tardif

4 citations · 16 across the 17 of their papers we have counts for

collaborators

18 papers

math.CO2020★ 4 cited

Colouring homogeneous structures

Norbert Sauer

A relational structure is indivisible if for every partition of its set of elements into two parts there exists an embedding of the structure into one of the parts of the partition…

math.CO2020★ 1 cited

The poset of copies for automorphism groups of countable relational structures

Claude Laflamme, Maurice Pouzet, Norbert Sauer +1

Let be a subgroup of the symmetric group of all permutations of a countable set . Let be the topological closure of $\mathr…

math.CO2018★ 1 cited

Distinguishing number of Urysohn metric spaces

Anthony Bonato, Claude Laflamme, Micheal Pawliuk +1

The distinguishing number of a structure is the smallest size of a partition of its elements so that only the trivial automorphism of the structure preserves each cell of the parti…

math.LO2018

Siblings of an -categorical relational structure

Claude Laflamme, Maurice Pouzet, Norbert Sauer +1

A sibling of a relational structure is any structure which can be embedded into and, vice versa, in which can be embedded. Let be the number of siblings of…

math.CO2015★ 4 cited

Invariant subsets of scattered trees. An application to the tree alternative property of Bonato and Tardif

Claude Laflamme, Maurice Pouzet, Norbert Sauer

A tree is scattered if no subdivision of the complete binary tree is a subtree. Building on results of Halin, Polat and Sabidussi, we identify four types of subtrees of a scattered…

math.CO2014

Rainbow Ramsey simple structures

Natasha Dobrinen, Claude Laflamme, Norbert Sauer

A relational structure is {\em rainbow Ramsey} if for every finite induced substructure of and every colouring of the copies of …