Path $P_6$ edge-inducibility conjecture

Let $P_6$ be the path on six vertices. The paper establishes the bounds

$$\frac{5}{372}\leq \operatorname{eind}(P_6)\leq \frac{1}{36}.$$

Path $P_6$ edge-inducibility conjecture. The lower bound is exact:

$$\operatorname{eind}(P_6)=\frac{5}{372}.$$

The conjecture concerns one of the paper's remaining unsettled small-graph cases and asserts optimality of the known construction; the source gives no resolution.