Anti-Ramsey Hypergraph Numbers

The anti-Ramsey number arn(H) of an r-uniform hypergraph is the maximum number of colors that can be used to color the hyperedges of a complete r-uniform hypergraph on n vertices without producing a rainbow copy of H. In this paper, we determine anti-Ramsey numbers for paths of length 2, certain sta...

全面介绍

Saved in:
书目详细资料
Main Authors: Budden, Mark; Department of Mathematics and Computer Science, Western Carolina University, Cullowhee, NC 28723, USA (Author), Stiles, William; Department of Mathematics and Statistics, University of North Carolina at Greensboro 116 Petty Building, PO Box 26170, Greensboro, NC 27402, USA (Author)
格式: EJournal Article
出版: GTA Research Group, Univ. Newcastle, Indonesian Combinatorics Society and ITB, 2021-10-16.
主题:
在线阅读:Get Fulltext
标签: 添加标签
没有标签, 成为第一个标记此记录!

因特网

Get Fulltext

3rd Floor Main Library

持有资料详情 3rd Floor Main Library
索引号: A1234.567
复印件 1 可用