Jérémie Turcotte

According to our database, Jérémie Turcotte authored at least 11 papers between 2020 and 2024.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2024

Cops and Robbers on \(\boldsymbol{P_5}\)-Free Graphs.

Maria Chudnovsky, Sergey Norin, Paul D. Seymour, Jérémie Turcotte

SIAM J. Discret. Math., March, 2024

The burning number conjecture holds asymptotically.

Sergey Norin, Jérémie Turcotte

J. Comb. Theory B, 2024

Longest cycles in vertex-transitive and highly connected graphs.

Carla Groenland, Sean Longbrake, Raphael Steiner, Jérémie Turcotte, Liana Yepremyan

CoRR, 2024

On an Induced Version of Menger's Theorem.

Kevin Hendrey, Sergey Norin, Raphael Steiner, Jérémie Turcotte

Electron. J. Comb., 2024

2023

Twin-width of sparse random graphs.

Kevin Hendrey, Sergey Norin, Raphael Steiner, Jérémie Turcotte

CoRR, 2023

Improved bounds on the cop number when forbidding a minor.

Franklin Kenter, Erin Meger, Jérémie Turcotte

CoRR, 2023

Cops and robbers on P₅-free graphs.

Maria Chudnovsky, Sergey Norin, Paul D. Seymour, Jérémie Turcotte

CoRR, 2023

2022

Cops and robbers on 2<i>K</i>₂-free graphs.

Jérémie Turcotte

Discret. Math., 2022

2021

Cops and robbers on directed and undirected abelian Cayley graphs.

Peter Bradshaw, Seyyed Aliasghar Hosseini, Jérémie Turcotte

Eur. J. Comb., 2021

4-cop-win graphs have at least 19 vertices.

Jérémie Turcotte, Samuel Yvon

Discret. Appl. Math., 2021

2020

Cops and robbers on 2K₂-free graphs.

Jérémie Turcotte

CoRR, 2020