33 citations · 242 across the 67 of their papers we have counts for
Showing 2016Show all
3 papers · 1 filter
cs.DM2016
-bounded families of oriented graphs
Pierre Aboulker, Jørgen Bang-Jensen, Nicolas Bousquet +4
A famous conjecture of Gyárfás and Sumner states for any tree and integer , if the chromatic number of a graph is large enough, either the graph contains a clique of size $k…
cs.DM2016★ 3 cited
Token Sliding on Chordal Graphs
Marthe Bonamy, Nicolas Bousquet
Let I be an independent set of a graph G. Imagine that a token is located on any vertex of I. We can now move the tokens of I along the edges of the graph as long as the set of tok…
math.OA2016★ 5 cited
Groupoid exactness and the weak containment problem
Claire Anantharaman-Delaroche
Our purpose is to study in the setting of locally compact groupoids the analogues of the well-known equivalent definitions of exactness for discrete groups. Our best results are ob…