Gil Puig i Surroca ORCID: 0009-0003-7116-7633

Email: name.surname1-i-surname2(at)dauphine.eu office M140, katedra algebry a geometrie Fakulta matematiky, fyziky a informatiky (Univerzity Komenského) Mlynská dolina F1 842 48 Bratislava

• MICINN project ACoGe (Algebraic combinatorics and its connections to geometry – PID2022-137283NB-C22), associated member

(past)

• ANR project DAGDigDec (Directed acyclic graphs and digraph decompositions – ANR-21-CE48-0012), non-permanent member.
• MICINN project ALCOI (Álgebra conmutativa y sus interacciones – PID2019-194844GB-I00), associated member.

Preprints and publications

1. A. Harutyunyan, L. Picasarri-Arrieta and G. Puig i Surroca, On the list version of a conjecture of Erdős and Neumann-Lara, submitted. [arXiv]
2. A. Harutyunyan, K. Kawarabayashi, L. Picasarri-Arrieta and G. Puig i Surroca, (Δ−1)-dicolouring of digraphs, submitted. [arXiv]
3. K. Knauer and G. Puig i Surroca, On rigid regular graphs and a problem of Babai and Pultr, Eur. J. Comb. 140 (2027) 104466. [arXiv]
4. 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 (to appear). [arXiv]
5. 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.
6. K. Knauer and G. Puig i Surroca, On endomorphism universality of sparse graph classes, J. Graph Theory 110 (2025) 223–244. [arXiv]
7. K. Knauer and G. Puig i Surroca, On monoid graphs, Mediterr. J. Math. 20 (2023) #26. [arXiv]

Theses

• Some topics on digraph colouring
  PhD thesis
• Symmetries and partial cubes
  MSc thesis

Last update: November 2026