11 citations · 19 across the 11 of their papers we have counts for
Showing cs.DMShow all
2 papers · 1 filter
cs.DM2020
Graphs with no induced house nor induced hole have the de Bruijn-Erdős property
Pierre Aboulker, Laurent Beaudou, Martín Matamala +1
A set of n points in the plane which are not all collinear defines at least n distinct lines. Chen and Chvátal conjectured in 2008 that a similar result can be achieved in the broa…
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…