Anti-Ramsey theory on complete bipartite graphs

Stephan Cho; Jay Cummings; Colin Defant; Claire Sonneborn

doi:10.1016/j.akcej.2019.08.010

Back

Anti-Ramsey theory on complete bipartite graphs

Journal article

Open access

Peer reviewed

Anti-Ramsey theory on complete bipartite graphs

Stephan Cho, Jay Cummings, Colin Defant and Claire Sonneborn

AKCE International Journal of Graphs and Combinatorics, Vol.17(3), pp.948-951

05/21/2020

DOI: https://doi.org/10.1016/j.akcej.2019.08.010

Handle:

https://hdl.handle.net/20.500.12741/rep:9163

Abstract

rainbow

projective plane

Graph coloring

bipartite

Primary 05C15

Secondary 05B15

latin square

edge-coloring

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.

Files and links (1)

url

https://doi.org/10.1016/j.akcej.2019.08.010View

Published (Version of record) Open

Metrics

Details

Title: Anti-Ramsey theory on complete bipartite graphs
Creators: Stephan Cho - Department of Mathematics
Jay Cummings - Department of Mathematics, UC San Diego, San Diego, CA, USA
Colin Defant - Department of Mathematics, Princeton University, Princeton, NJ, USA
Claire Sonneborn - Department of Mathematics, University of Dayton, Dayton, OH, USA
Academic Unit: Mathematics/Statistics Department
Publisher: Taylor & Francis
Publication Details: 05/21/2020
Identifiers: 99257880102201671; https://hdl.handle.net/20.500.12741/rep:9163; https://doi.org/10.1016/j.akcej.2019.08.010
Language: English