From the 1 of 4 linked papers with an AI index.
4 papers
Acyclic Dichromatic Number of Tournaments: these are the Champions
Pierre Aboulker, Pierre Charbit, Samuel Coulomb +2
The paper characterizes the subtournaments that must occur in any tournament with a sufficiently large acyclic dichromatic number, confirming a conjecture and establishing a local‑…
Extending Ghouila-Houri's Characterization of Comparability Graphs to Temporal Graphs
Pierre Charbit, Michel Habib, Amalia Sorondo
An orientation of a given static graph is called transitive if for any three vertices , the presence of arcs and forces the presence of the arc . If o…
Clique number of tournaments
Pierre Aboulker, Guillaume Aubian, Pierre Charbit +1
Given a digraph together with an ordering of its vertices, the \emph{backedge graph} of with respect to is the undirected graph with the same ve…
A Dense Neighborhood Lemma: Applications of Partial Concept Classes to Domination and Chromatic Number
Romain Bourneuf, Pierre Charbit, Stéphan Thomassé
In its Euclidean form, the Dense Neighborhood Lemma (DNL) asserts that if is a finite set of points of such that for each the ball intersects…