Anti-Ramsey number of expansions of paths and cycles in uniform hypergraphs

doi:10.1002/jgt.22847

CSpace > 博士后

	Anti-Ramsey number of expansions of paths and cycles in uniform hypergraphs
	Tang, Yucong 1,2; Li, Tong3 ; Yan, Guiying3,4
	2022-06-14
发表期刊	JOURNAL OF GRAPH THEORY
ISSN	0364-9024
页码	18
摘要	For an r $r$-graph F $F$, the anti-Ramsey number ar(n , r , F ) $\text{ar}(n,r,F)$ is the minimum number c $c$ of colors such that for any edge-coloring of the complete r $r$-graph on n $n$ vertices with at least c $c$ colors, there is a copy of F $F$ whose edges have distinct colors. Let P k ${P}_{k}$ and C k ${C}_{k}$ be the path and cycle with k $k$ edges in 2-graphs, respectively. In this paper, we determine ar(n , r , P k + ) $\text{ar}(n,r,{P}_{k}<^>{+})$ and ar(n , r , C k + ) $\text{ar}(n,r,{C}_{k}<^>{+})$ for all k >= 3 $k\ge 3$ and r >= 3 $r\ge 3$ except ar(n , r , C 3 + ) $\text{ar}(n,r,{C}_{3}<^>{+})$, which are extensions of several results of Gu, Li, and Shi.
关键词	anti-Ramsey number expansions hypergraphs paths and cycles stability
DOI	10.1002/jgt.22847
收录类别	SCI
语种	英语
资助项目	National Natural Science Foundation of China[11901292] ; National Natural Science Foundation of China[11631014]
WOS研究方向	Mathematics
WOS类目	Mathematics
WOS记录号	WOS:000810356500001
出版者	WILEY
引用统计
文献类型	期刊论文
条目标识符	http://ir.amss.ac.cn/handle/2S8OKBNM/61515
专题	博士后应用数学研究所
通讯作者	Yan, Guiying
作者单位	1.Nanjing Univ Aeronaut & Astronaut, Dept Math, Nanjing, Peoples R China 2.MIIT, Key Lab Math Modelling & High Performance Comp Ai, Nanjing, Peoples R China 3.Chinese Acad Sci, Acad Math & Syst Sci, 55 Zhongguancun Rd, Beijing 100190, Peoples R China 4.Univ Chinese Acad Sci, Sch Math Sci, Beijing, Peoples R China
推荐引用方式 GB/T 7714	Tang, Yucong,Li, Tong,Yan, Guiying. Anti-Ramsey number of expansions of paths and cycles in uniform hypergraphs[J]. JOURNAL OF GRAPH THEORY,2022:18.
APA	Tang, Yucong,Li, Tong,&Yan, Guiying.(2022).Anti-Ramsey number of expansions of paths and cycles in uniform hypergraphs.JOURNAL OF GRAPH THEORY,18.
MLA	Tang, Yucong,et al."Anti-Ramsey number of expansions of paths and cycles in uniform hypergraphs".JOURNAL OF GRAPH THEORY (2022):18.