Pith. sign in

REVIEW

A note on Gallai-Ramsey number of even wheels

Not yet reviewed by Pith; the record is open.

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 1905.13564 v2 pith:QQQZHZH3 submitted 2019-05-30 math.CO

classification math.CO
keywords coloringgallaigallai-ramseygraphnumbercompleteeveninteger
verification ladder T0 review T1 audit T2 compute T3 formal

Signed reviews

No signed human review yet.

0 comments
abstract

A Gallai coloring of a complete graph is an edge-coloring such that no triangle has all its edges colored differently. A Gallai $k$-coloring is a Gallai coloring that uses $k$ colors. Given a graph $H$ and an integer $k\geq 1$, the Gallai-Ramsey number $GR_k(H)$ of $H$ is the least positive integer $N$ such that every Gallai $k$-coloring of the complete graph $K_N$ contains a monochromatic copy of $H$. Let $W_{2n} $ denote an even wheel on $2n+1\ge5$ vertices. In this note, we study Gallai-Ramsey number of $W_{2n}$ and completely determine the exact value of $GR_k(W_4)$ for all $k\ge2$.

Discussion (0). Continue with ORCID to comment.

Pith tools