An Anti-Ramsey Problem Concerning Complete Bipartite Graphs

MaRDI QIDQ6257127zbMATH OpenFDO

Authors Stephan Cho, Jay Cummings, Colin Defant, Claire Sonneborn

Publication date 9 December 2014

Mathematics Subject Classification ID

Orthogonal arrays, Latin squares, Room squares (05B15) Coloring of graphs and hypergraphs (05C15)

Abstract: We consider quadruples of positive integers $(a,b,m,n)$ with $aleqb$ and $mleqn$ such that any proper edge-coloring of the complete bipartite graph $K_{m,n}$ contains a rainbow $K_{a,b}$ subgraph. We show that any such quadruple with $aleqm$ and $n>(a^2-a+1)(b-1)$ satisfies this property. We also show that the quadruple $(2,3,3,6)$ satisfies this property. We end with a conjecture.

This page was built for publication: An Anti-Ramsey Problem Concerning Complete Bipartite Graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6257127)