Katherine Staden

collaborators

2 papers

math.CO2025

The semi-inducibility problem

Abdul Basit, Bertille Granet, Daniel Horsley +2

Let $H$ be a $k$ -edge-coloured graph and let $n$ be a positive integer. What is the maximum number of copies of $H$ in a $k$ -edge-coloured complete graph on $n$ vertices? This pape…

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 $s$ -edge colourings in an $n$ -vertex graph which avoid a monochromatic copy of $K_{k}$ , given positive integers…

The semi-inducibility problem

A framework for the generalised ErdÅs-Rothschild problem and a resolution of the dichromatic triangle case

A framework for the generalised ErdÅs-Rothschild problem and a resolution of the dichromatic triangle case