Path P6P_6P6 edge-inducibility conjecture
Path P6P_6P6 edge-inducibility conjecture. The lower bound is exact:
Cycle edge-inducibility conjecture
Cycle edge-inducibility conjecture. For every integer k≥4k\geq 4k≥4,