6 citations · 8 across the 7 of their papers we have counts for
Showing 2025Show all
2 papers · 1 filter
math.CO2025
Hamilton decompositions of regular tripartite tournaments
Francesco Di Braccio, Joanna Lada, Viresh Patel +2
Kühn and Osthus conjectured in 2013 that regular tripartite tournaments are decomposable into Hamilton cycles. Somewhat surprisingly, Granet gave a simple counterexample to this co…
math.CO2025
A framework for the generalised Erdős-Rothschild problem and a resolution of the dichromatic triangle case
Pranshu Gupta, Yani Pehova, Emil Powierski +1
The Erdős-Rothschild problem from 1974 asks for the maximum number of -edge colourings in an -vertex graph which avoid a monochromatic copy of , given positive integers…