R. Brignall

activity

20062026

most citedThe enumeration of permutations avoiding 2143 and 4231

14 citations · 78 across the 33 of their papers we have counts for

collaborators

Showing 2015 · math.COShow all

3 papers · 2 filters

math.CO2015

Well-quasi-ordering and finite distinguishing number

Aistis Atminas, Robert Brignall

Balogh, Bollobas and Weinreich showed that a parameter that has since been termed the distinguishing number can be used to identify a jump in the possible speeds of hereditary clas…

math.CO2015

$2 \times 2$ monotone grid classes are finitely based

Michael Albert, Robert Brignall

In this note, we prove that all $2 \times 2$ monotone grid classes are finitely based, i.e., defined by a finite collection of minimal forbidden permutations. This follows from a s…

math.CO2015★ 4 cited

Minimal classes of graphs of unbounded clique-width defined by finitely many forbidden induced subgraphs

A. Atminas, R. Brignall, V. Lozin +1

We discover new hereditary classes of graphs that are minimal (with respect to set inclusion) of unbounded clique-width. The new examples include split permutation graphs and bicha…

Well-quasi-ordering and finite distinguishing number

2×2 monotone grid classes are finitely based

Minimal classes of graphs of unbounded clique-width defined by finitely many forbidden induced subgraphs

$2 \times 2$ monotone grid classes are finitely based