Quentin Chuet
Embedded Files
Starting from September 1st, 2026, I am Attaché Temporaire d'Enseignement et de Recherche (ATER) at Université de Montpellier Paul-Valéry, and in the AlGCo team at LIRMM.
I completed my PhD in July 2026 at LISN (Université Paris-Saclay) under the supervision of Nathalie Aubrun and François Pirot; my thesis, titled Variations on the graph colouring problem, explores the extremal aspects of graph colourings in bounded degree graphs.
I am more broadly interested in graph theory and the probabilistic method.
Works
Pre-publications:
A Domatic Analogue of χ-Bounded Graph Classes and the Gyárfás-Sumner Conjecture [arXiv]
Quentin Chuet, Selma Djelloul, Hoang La, François Pirot, Hossein Zaredehabadi (2026)
Frugal colourings of graphs via sparse hypergraph colouring [arXiv]
Quentin Chuet (2026)
Inversion diameter and 2-edge-colored homomorphisms [arXiv]
with Carmen Arana, Thomas Bellitto, Hector Buffière, Théo Pierron and Amadeus Reinald (2026)
Fractional domatic number and minimum degree [arXiv]
with Hugo Demaret, Hoang La, François Pirot (2025)
Journal papers:
New bounds for proper h-conflict-free colourings
with Tianjiao Dai, Qiancheng Ouyang and François Pirot
Random Structures & Algorithms 68.2 (2026): e70054
Acyclic colourings of graphs with obstructions
with Johanne Cohen and François Pirot
SIAM Journal on Discrete Mathematics 39.1 (2025): 505-532
A note on locating-dominating sets in twin-free graphs
with Nicolas Bousquet, Victor Falgas-Ravry, Amaury Jacques and Laure Morelle
Teaching
2025 - 2026 (Université Paris-Saclay) :
Algorithmique (L3, TD)
2024 - 2025 (Université Paris-Saclay) :
Algorithmique (L3, TD)
Programmation Modulaire (L1, TP)
2023 - 2024 (Université Paris-Saclay) :
Programmation fonctionnelle avancée (L3, TP)
Algorithmique (Polytech, TD et TP)
Projet Java (M1, TP)
Other
Talks:
Acyclic colourings of graphs with obstructions, Journées Graphes et Algorithmes 2022 (Paris, France)
Diameter-t colourings of graphs, Journées Graphes et Algorithmes 2023 (Lyon, France)
Acyclic colourings of graphs with obstructions, Cycles and Colourings 2024 (Poprad, Slovakia)
A note on locating-dominating sets in twin-free graphs, Journées Graphes et Algorithmes 2024 (Dijon, France)
New bounds for proper h-conflict-free colourings, Eurocomb 2025 (Budapest, Hungary)
Proper conflict-free colouring of graphs, Journées Graphes et Algorithmes 2025 (Paris, France)
You may have seen me there:
École de Printemps en Informatique Théorique 2024 (Aussois, France)
School on Graph Theory 2025 (Nouan-le-Fuzelier, France)
Page updated
Google Sites
Report abuse