3 papers
math.CO2026
Compatible Hamilton cycles in graphs with large minimum degree
Natalie Behague, Francesco Di Braccio, Bertille Granet +1
The renowned theorem of Dirac states that if is a graph with minimum degree at least then has a Hamilton cycle. A natural generalisation asks what properties of an ed…
math.CO2025
The semi-inducibility problem
Abdul Basit, Bertille Granet, Daniel Horsley +2
Let be a -edge-coloured graph and let be a positive integer. What is the maximum number of copies of in a -edge-coloured complete graph on vertices? This pape…
math.CO2022
Hamilton decompositions of regular bipartite tournaments
Bertille Granet
A regular bipartite tournament is an orientation of a complete balanced bipartite graph where every vertex has its in- and outdegree both equal to . In 1981, Jackson…