Search results
François Pirot. About me. Since September 1st 2021, I am an associate professor (maître de conférences) in Université Paris-Saclay. I am doing my research at the LISN in the team GALaC, and I am teaching at the Faculté des Sciences d'Orsay. Before that, I have held three postdoctoral positions.
françois Pirot. We investigate the effect of a fixed forbidden clique minor upon the strong chromatic index, both in multigraphs and in simple graphs. We conjecture for each $k\ge 4$ that any...
Strong chromatic index and Hadwiger number. Wouter Cames van Batenburg, Rémi de Joannis de Verclos, Ross J. Kang, François Pirot. Comments: 23 pages, 4 figures; v2 includes minor corrections, to appear in Journal of Graph Theory.
Sep 30, 2021 · Colouring locally sparse graphs with the first moment method. François Pirot, Eoin Hurley. We give a short proof of a bound on the list chromatic number of graphs of maximum degree where each neighbourhood has density at most , namely as .
- François Pirot, Eoin Hurley
- arXiv:2109.15215 [math.CO]
- 2021
François Pirot Under the supervision of. Miguel . Couceiro, Eric Cator, Ross Kang, and Jean-Sébastien Sereni. 04/11/2019. What is a graph? 04/11/2019 François Pirot 2.
François Pirot. francois.pirot@lisn.fr Université Paris-Saclay France. interesting problems. In particular, colourings of sparse graphs and random graphs of average degree Δ with: ln: = Ω(Δ) colours have proved to be a rich source of phase transition type behaviour.
Jun 2, 2023 · New bounds for odd colourings of graphs. Tianjiao Dai, Qiancheng Ouyang, François Pirot. Given a graph G, a vertex-colouring \sigma of G, and a subset X\subseteq V (G), a colour x \in \sigma (X) is said to be \emph {odd} for X in \sigma if it has an odd number of occurrences in X.
