The Generalized Ramsey Number f(n,5,8)=67n+o(n)
ABSTRACT 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.
Authors
- Patrick Bennett (ORCID: https://orcid.org/0000-0003-3147-4690)
- Andrzej Dudek (ORCID: https://orcid.org/0000-0002-6410-5413)
- Ryan Cushman (ORCID: https://orcid.org/0000-0003-1792-3875)
Institutions
- Western Michigan University (US)
- University of Tennessee at Knoxville (US)
Publication Details
- Journal
- Journal of Graph Theory
- Published
- 2026-03-22
- DOI
- https://doi.org/10.1002/jgt.70015
- Primary Topic
- Limits and Structures in Graph Theory
- Type
- article
- Field-Weighted Citation Impact
- 0.00