Anti-Ramsey numbers for cancellative configurations in p-graphs
Cheng Chi, Long-tu Yuan

TL;DR
This paper investigates edge-colorings of complete p-graphs avoiding certain symmetric difference configurations, establishing bounds on the number of colors and characterizing extremal colorings, with implications for rainbow cancellative and Steiner triple systems.
Contribution
It generalizes a theorem of Erdős, Simonovits, and Sós to p-graphs, characterizes extremal colorings, and improves bounds related to rainbow F4-free colorings.
Findings
Maximum number of colors is at most 1 + floor(n/p) for p ≥ 3.
Constructs colorings with m(n)+1 colors for rainbow F4-free colorings, improving previous bounds.
Provides upper bounds on the number of colors for rainbow F4-free colorings, refining earlier quadratic bounds.
Abstract
We study edge-colorings of the complete -graph on vertices that contain no three edges of distinct colors such that the symmetric difference of and is contained in . For and , we show that every such coloring contains at most colors and characterize the extremal colorings, generalizing a theorem of Erd\H{o}s, Simonovits and S\'os. %\cite{erdos1975}. When , the condition implies , and the three edges necessarily form a copy of or . For , we show that every rainbow -free edge-coloring is rainbow cancellative. For rainbow -free colorings, we construct colorings with colors for all , where is the size of a maximum partial Steiner triple system of order and satisfies…
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.
