Anti-Ramsey Hypergraph Numbers

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

Full description

Saved in:
Bibliographic Details
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)
Format: EJournal Article
Published: GTA Research Group, Univ. Newcastle, Indonesian Combinatorics Society and ITB, 2021-10-16.
Subjects:
info:eu-repo/semantics/article
info:eu-repo/semantics/publishedVersion
Peer-reviewed Article
Online Access:Get Fulltext
Tags: Add Tag
No Tags, Be the first to tag this record!

Internet

Get Fulltext

3rd Floor Main Library

Holdings details from 3rd Floor Main Library
Call Number: A1234.567
Copy 1 Available

Similar Items