2 papers
math.CO2024
Simultaneous edge-colourings
Simona Boyadzhiyska, Richard Lang, Allan Lo +1
We study a generalisation of Vizing's theorem, where the goal is to simultaneously colour the edges of graphs with few colours. We obtain asymptotically optimal bou…
math.CO2024
Perfect matchings and loose Hamilton cycles in the semirandom hypergraph model
Michael Molloy, Pawel Pralat, Gregory B. Sorkin
We study the 2-offer semirandom 3-uniform hypergraph model on vertices. At each step, we are presented with 2 uniformly random vertices. We choose any other vertex, thus creati…