1 citations · 2 across the 8 of their papers we have counts for
4 papers · 1 filter
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…
Extension Complexity of the Correlation Polytope
Pierre Aboulker, Samuel Fiorini, Tony Huynh +2
We prove that for every -vertex graph , the extension complexity of the correlation polytope of is , where is the treewid…
-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…
Excluding cycles with a fixed number of chords
Pierre Aboulker 'and' Nicolas Bousquet
Trotignon and Vuskovic completely characterized graphs that do not contain cycles with exactly one chord. In particular, they show that such a graph G has chromatic number at most…