activity
19932022
most citedStrong meager properties for filters

7 citations · 25 across the 21 of their papers we have counts for

collaborators
Showing math.COShow all

14 papers · 1 filter

math.CO2022★ 1 cited

An example of Tateno disproving conjectures of Bonato-Tardif, Thomasse, and Tyomkyn

Davoud Abdi, Claude Laflamme, Atsushi Tateno +1

In his 2008 thesis, Tateno claimed a counterexample to the Bonato-Tardif conjecture regarding the number of equimorphy classes of trees. In this paper we revisit Tateno's unpublish…

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.CO2016

Balanced independent sets in graphs omitting large cliques

Claude Laflamme, Andres A. Lopez, Daniel T. Soukup +1

Our goal is to investigate a close relative of the independent transversal problem in the class of infinite -free graphs: we show that for any infinite -free graph $G=(V,…

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 …