Emily Cairncross

collaborators

2 papers

math.CO2024

Inducibility of rainbow graphs

Emily Cairncross, Clayton Mizgerd, Dhruv Mubayi

Fix $k \geq 11$ and a rainbow $k$ -clique $R$ . We prove that the inducibility of $R$ is $k! / (k^{k} - k)$ . An extremal construction is a balanced recursive blow-up of $R$ . This answers a q…

math.CO2024

Ordered and colored subgraph density problems

Emily Cairncross, Dhruv Mubayi

We consider three extremal problems about the number of copies of a fixed graph in another larger graph. First, we correct an error in a result of Reiher and Wagner and prove that…