Homepage of Gil Puig i Surroca

Gil Puig i Surroca

ORCID: 0009-0003-7116-7633

Email: name.surname1-i-surname2(at)dauphine.eu
Office 603b
Université Paris Dauphine - PSL
Place du Maréchal de Lattre de Tassigny
75775 PARIS Cedex 16

I am an ATER at LAMSADE. I recently defended my PhD thesis, which I did under the supervision of Ararat Harutyunyan, Denis Cornaz and Kolja Knauer. In the past I also had the fortune of being mentored by Carlos D'Andrea .
In general, my research interests are within graph theory and combinatorics. I have mostly worked on digraph colouring and graph endomorphisms.

Projects

MICINN project ACoGe (Algebraic combinatorics and its connections to geometry – PID2022-137283NB-C22), associated member
ANR project DAGDigDec (Directed acyclic graphs and digraph decompositions – ANR-21-CE48-0012), non-permanent member.

(past)

MICINN project ALCOI (Álgebra conmutativa y sus interacciones – PID2019-194844GB-I00), associated member.

Preprints and publications

A. Harutyunyan, L. Picasarri-Arrieta and G. Puig i Surroca, On the list version of a conjecture of Erdős and Neumann-Lara. [arXiv]
A. Harutyunyan, K. Kawarabayashi, L. Picasarri-Arrieta and G. Puig i Surroca, (Δ−1)-dicolouring of digraphs, submitted. [arXiv]
K. Knauer and G. Puig i Surroca, On rigid regular graphs and a problem of Babai and Pultr, submitted. [arXiv]
A. Harutyunyan, C. McDiarmid and G. Puig i Surroca, Acyclic sets and colorings in digraphs under restrictions on degrees and cycle lengths, J. Graph Theory (accepted). [arXiv]
A. Harutyunyan and G. Puig i Surroca, Colouring complete multipartite and Kneser-type digraphs, Electron. J. Comb. 32 (2025) #P3.1. [arXiv].
Also as an [extended abstract] at Proc. 12th EUROCOMB (2023), #76, 545–551.
K. Knauer and G. Puig i Surroca, On endomorphism universality of sparse graph classes, J. Graph Theory 110 (2025) 223–244. [arXiv]
K. Knauer and G. Puig i Surroca, On monoid graphs, Mediterr. J. Math. 20 (2023) #26. [arXiv]

Last update: March 2026