1 paper
Paul W. Dyson, Brendan D. McKay
A problem proposed by Erdős, Fajtlowicz and Staton asks for the smallest n for which every graph on n vertices contains a regular induced subgraph of order at least k. A vari…