1 paper
Eoin Long, Laurentiu Ploscaru
Given an n-vertex graph G, let hom(G) denote the size of a largest homogeneous set in G and let f(G) denote the maximal number of distinct degrees appearing in an induc…