Rainbow clique inducibility for unresolved orders

Determine the inducibility of rainbow K_k in the remaining cases k∈{4,6,7,8,9,10}, and characterize their asymptotically extremal three-edge-coloured complete graphs.

Background

The paper summarizes recent results on rainbow clique inducibility. The cases k≥11 and k=5 are described as solved through balanced iterated blow-ups, while six clique orders remain explicitly unresolved.

References

Thus the remaining open cases are $k \in {4,6,7,8,9,10}$.

— The semi-inducibility problem  (2501.09842 - Basit et al., 16 Jan 2025) in Section 2.2, “The inducibility problem”