1 paper
Maria Axenovich, Ryan R. Martin
In this note, we fix a graph H and ask into how many vertices can each vertex of a clique of size n can be "split" such that the resulting graph is H-free. Formally: A graph…