Investigate piercing by small graphs

Investigate the behavior of g(n,Kp|F) when F is a graph of small order.

Background

Only selected small graphs are treated explicitly. The authors leave a broader classification of piercing by small graphs as an open direction.

References

Problem 10.27. Investigate the behavior of g(n, KpK(F)) where F is a graph of small order.

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