Extremal graph with quasirandom structure for inducibility

Determine whether there exists an ordinary graph, rather than a quantum graph, whose asymptotically extremal host graphs are necessarily quasirandom.

Background

The paper constructs a quantum graph whose extremal red graphs are uniquely quasirandom in the asymptotic sense. It explicitly asks whether this phenomenon can occur for inducibility of a single ordinary graph.