William Stiles
Department of Mathematics and Statistics, University of North Carolina at Greensboro 116 Petty Building, PO Box 26170, Greensboro, NC 27402, USA

Published : 1 Documents Claim Missing Document
Claim Missing Document
Check
Articles

Found 1 Documents
Search

Anti-Ramsey Hypergraph Numbers Mark Budden; William Stiles
Electronic Journal of Graph Theory and Applications (EJGTA) Vol 9, No 2 (2021): Electronic Journal of Graph Theory and Applications
Publisher : GTA Research Group, Univ. Newcastle, Indonesian Combinatorics Society and ITB

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.5614/ejgta.2021.9.2.12

Abstract

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 stars and complete hypergraphs, and the complete 3-uniform hypergraph of order 4 with a single hyperedge removed.