Anti-Ramsey theory on complete bipartite graphs

AKCE International Journal of Graphs and Combinatorics

Colin Defant¹  Jay Cummings²  Claire Sonneborn³  Stephan Cho⁴ 

[1] Department of Mathematics, Princeton University, Princeton, NJ, USA;Department of Mathematics, UC San Diego, San Diego, CA, USA;Department of Mathematics, University of Dayton, Dayton, OH, USA;Department of Mathematics;

关键词: graph coloring;    bipartite;    rainbow;    edge-coloring;    latin square;    projective plane;   

DOI  :  10.1016/j.akcej.2019.08.010

来源: DOAJ

【 摘 要 】

We consider quadruples of positive integers with and such that every proper edge-coloring of the complete bipartite graph contains a rainbow subgraph. We show that every such quadruple with and satisfies this property and find an infinite sequence where this bound is sharp. We also define and compute some new anti-Ramsey numbers.

【 授权许可】

Unknown