Matching piercing limit

Determine the asymptotic limits of g(n,K_{2p}|pK2)/n and f(n,K_{2p}|pK2)/n.

Background

The paper gives linear upper and lower bounds for piercing complete graphs by perfect matchings, differing by a constant factor. It asks for the exact normalized asymptotic behavior, including the corresponding complementary decomposition function.

References

Problem 10.21. Determine lim f(n, K2p|(pK2)) and lim g(n, K2pk(pK2)) 200 n . 200 n

Monochromatic graph decompositions and monochromatic piercing inspired by anti-Ramsey colorings  (2501.09342 - Caro et al., 16 Jan 2025) in Problem 10.21, Section 10.2