Pith. sign in

REVIEW

New bounds on the generalized Ramsey number $f(n,5,8)$

Not yet reviewed by Pith; the record is open.

Re-run · record.json Download PDF Read on arXiv ↗

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2308.16365 v2 pith:XC7FPCMG submitted 2023-08-30 math.CO

Enrique Gomez-Leos , Emily Heath , Alex Parker , Coy Schwieder , Shira Zerbib This is my paper · ORCID
classification math.CO
keywords colorsfracnumberboundboundscolorconflict-freecopy
verification ladder T0 review T1 audit T2 compute T3 formal

Signed reviews

No signed human review yet.

0 comments
abstract

Let $f(n,p,q)$ denote the minimum number of colors needed to color the edges of $K_n$ so that every copy of $K_p$ receives at least $q$ distinct colors. In this note, we show $\frac{6}{7}(n-1) \leq f(n,5,8) \leq n + o(n)$. The upper bound is proven using the "conflict-free hypergraph matchings method" which was recently used by Mubayi and Joos to prove $f(n,4,5) = \frac{5}{6}n + o(n)$.

Discussion (0). Continue with ORCID to comment.

Pith tools