An extremal problem motivated by triangle-free strongly regular graphs

We introduce the following combinatorial problem. Let G be a triangle-free regular graph with edge density rho. (In this paper all densities are normalized by n, n(2)/2 etc. rather than by n - 1, (n/2), ... ) What is the minimum value a(rho) for which there 2 always exist two non-adjacent vertices such that the density of their common neighbourhood is <= a(rho)? We prove a variety of upper bounds on the function a(rho) that are tight for the values rho = 2/5, 5/16, 3/10, 11/50, with C-5, Clebsch, Petersen and Higman-Sims being respective extremal configurations. Our proofs are entirely combinatorial and are largely based on counting densities in the style of flag algebras. For small values of rho, our bound attaches a combinatorial meaning to so-called Krein conditions that might be interesting in its own right. We also prove that for any epsilon & nbsp;> 0 there are only finitely many values of rho with a(rho) >= epsilon & nbsp;but this finiteness result is somewhat purely existential (the bound is double exponential in 1/epsilon). (C)& nbsp;2022 Elsevier Inc. All rights reserved.