Search

Given a graph $G$ and an integer $k \geq 2$, let $\chi'_k(G)$ denote the minimum number of colours required to colour the edges of $G$ such that, in

A central concept in social choice theory is that of a Condorcet winner: an outcome that defeats every alternative in a pairwise majority vote. While

Heads of departement : Laurent Bienvenu and Antoine Rollet Research in the M2F department encompasses several topics, including the foundations of