Given a $k$-vertex graph $H$ and an integer $n$, what are the $n$-vertex graphs with the maximum number of induced copies of $H$? This question is closely related to the inducibility problem introduced by Pippenger and Golumbic in 1975, which asks for the maximum possible fraction of $k$-vertex subsets of an $n$-vertex graph that induce a copy of $H$. Huang, Lee and the first author proved that for a random $k$-vertex graph $H$, almost surely the graphs on any given number of vertices that maximize the number of induced copies of $H$ are the balanced iterated blow-ups of $H$. In this paper, we consider the case where the graph $H$ is obtained by deleting a small number of vertices from a random Cayley graph $\widetilde{H}$ of an abelian group. We prove that in this case, almost surely all graphs on a given number of vertices that maximize the number of induced copies of $H$ are balanced iterated blow-ups of $\widetilde{H}$. This can be viewed as an analogue to the conjectured behavior in the intensively studied but still open case of $H$ being a path on sufficiently many vertices.
[1]
Jan Volec,et al.
A bound on the inducibility of cycles
,
2019,
J. Comb. Theory, Ser. A.
[2]
Noga Alon,et al.
The Probabilistic Method
,
2015,
Fundamentals of Ramsey Theory.
[3]
József Balogh,et al.
Maximum density of induced 5-cycle is achieved by an iterated blow-up of 5-cycle
,
2016,
Eur. J. Comb..
[4]
Nathan Linial,et al.
A Note on the Inducibility of $$4$$4-Vertex Graphs
,
2015,
Graphs Comb..
[5]
Carl Pomerance,et al.
The expected number of random elements to generate a finite abelian group
,
2002,
Period. Math. Hung..
[6]
Martin Charles Golumbic,et al.
The inducibility of graphs
,
1975
.
[7]
Raphael Yuster.
On the exact maximum induced density of almost all graphs and their inducibility
,
2019,
J. Comb. Theory, Ser. B.
[8]
Dan Hefetz,et al.
On the inducibility of cycles
,
2018,
J. Comb. Theory, Ser. B.