Graphs with no induced
arXiv:1912.07970 · doi:10.37236/9223
Abstract
Consider a graph on vertices with edges which does not contain an induced (). How large does have to be to ensure that contains, say, a large clique or some fixed subgraph ? We give results for two regimes: for bounded away from zero and for . Our results for are strongly related to the Induced Turán numbers which were recently introduced by Loh, Tait, Timmons and Zhou. For bounded away from zero, our results can be seen as a generalisation of a result of Gyárfás, Hubenko and Solymosi and more recently Holmsen (whose argument inspired ours).
8 pages; final version incorporating changes suggested by referees; new result in last section