Properly colored $C_{4}$'s in edge-colored graphs
Combinatorics
2019-05-30 v2 Discrete Mathematics
Abstract
When many colors appear in edge-colored graphs, it is only natural to expect rainbow subgraphs to appear. This anti-Ramsey problem has been studied thoroughly and yet there remain many gaps in the literature. Expanding upon classical and recent results forcing rainbow triangles to appear, we consider similar conditions which force the existence of a properly colored copy of .
Cite
@article{arxiv.1905.10584,
title = {Properly colored $C_{4}$'s in edge-colored graphs},
author = {Chuandong Xu and Colton Magnant and Shenggui Zhang},
journal= {arXiv preprint arXiv:1905.10584},
year = {2019}
}
Comments
corrected a statement after Theorem 4