Remarks on the distribution of colors in Gallai colorings
Joseph Feffer, Yaoying Fu, Jun Yan

TL;DR
This paper investigates the distribution of colors in Gallai colorings of complete graphs, establishing bounds on the minimum number of vertices needed for all color distributions to be realizable.
Contribution
The authors determine the exact value of g(5) and provide nearly tight bounds for g(k), extending previous results on color distribution in Gallai colorings.
Findings
g(5)=10
Bounds for g(k): rac{ ext{constant} imes k^{1.5}}{ ext{log} k} ext{ to } ext{constant} imes k^{1.5}
Extended understanding of color distribution thresholds in Gallai colorings.
Abstract
A Gallai coloring of a complete graph is an edge coloring without triangles colored with three different colors. A sequence of positive integers is an -sequence if . An -sequence is a G-sequence if there is a Gallai coloring of with colors such that there are edges of color for all . Gy\'arf\'as, P\'alv\"olgyi, Patk\'os and Wales proved that for any integer there exists an integer such that every -sequence is a G-sequence if and only if . They showed that and . We show that and give almost matching lower and upper bounds for by showing that with suitable constants , for all sufficiently large .
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
