Properly colored C4’s in edge-colored graphs

Chuandong Xu; Colton Magnant; Shenggui Zhang

doi:10.1016/j.disc.2020.112116

Properly colored C₄’s in edge-colored graphs

Chuandong Xu
, Colton Magnant
, Shenggui Zhang

数学与统计学院

Xidian University
United Parcel Service
Academy of Plateau Science and Sustainability

科研成果: 期刊稿件 › 文章 › 同行评审

9 引用（Scopus）

摘要

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 C₄.

源语言	英语
文章编号	112116
期刊	Discrete Mathematics
卷	343
期	12
DOI	https://doi.org/10.1016/j.disc.2020.112116
出版状态	已出版 - 12月 2020

访问文件

10.1016/j.disc.2020.112116

其它文件与链接

链接到 Scopus 的出版物

引用此

@article{971240f839204d599a938f78a8b341f1,

title = "Properly colored C4{\textquoteright}s in edge-colored graphs",

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 C4.",

keywords = "Anti-Ramsey number, Color degree, Extremal graph, Properly colored cycle, Threshold graph",

author = "Chuandong Xu and Colton Magnant and Shenggui Zhang",

note = "Publisher Copyright: {\textcopyright} 2020 Elsevier B.V.",

year = "2020",

month = dec,

doi = "10.1016/j.disc.2020.112116",

language = "英语",

volume = "343",

journal = "Discrete Mathematics",

issn = "0012-365X",

publisher = "Elsevier B.V.",

number = "12",

}

TY - JOUR

T1 - Properly colored C4’s in edge-colored graphs

AU - Xu, Chuandong

AU - Magnant, Colton

AU - Zhang, Shenggui

PY - 2020/12

Y1 - 2020/12

N2 - 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 C4.

AB - 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 C4.

KW - Anti-Ramsey number

KW - Color degree

KW - Extremal graph

KW - Properly colored cycle

KW - Threshold graph

UR - https://www.scopus.com/pages/publications/85089808545

U2 - 10.1016/j.disc.2020.112116

DO - 10.1016/j.disc.2020.112116

M3 - 文章

AN - SCOPUS:85089808545

SN - 0012-365X

VL - 343

JO - Discrete Mathematics

JF - Discrete Mathematics

IS - 12

M1 - 112116

ER -

Properly colored C4’s in edge-colored graphs

摘要

访问文件

其它文件与链接

指纹

引用此

Properly colored C₄’s in edge-colored graphs