This analysis proves an asymptotically matching upper bound for generalized Ramsey numbers with edge coloring.
A ‐ coloring of is a coloring of the edges of such that every ‐clique has at least distinct colors among its edges. The generalized Ramsey number is the minimum number of colors such that has a ‐coloring. Gomez‐Leos, Heath, Parker, Schweider and Zerbib recently proved . Here we prove an asymptotically matching upper bound.
No takes yet. Share an insight, caveat, or question.
Bennett et al. (2026) studied this question.
Synapse has enriched 5 closely related papers on similar clinical questions. Consider them for comparative context: