Determine anti-Ramsey numbers for minimum-degree families

Determine Ar(n,Hp,d) for p>d>1, where Hp,d is the family of graphs of order p and minimum degree d.

Background

The family Hp,d is relevant because its members act as blockers for stars in specified parameter ranges. The corresponding anti-Ramsey numbers are left as an open problem.

References

Problem 10.31. Determine Ar(n, Hp,d) for p > d > 1, where Hp,d is the family of graphs of order p and minimum degree d.

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