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

Descripció completa

Guardat en:
Dades bibliogràfiques
Autors principals: Budden, Mark; Department of Mathematics and Computer Science, Western Carolina University, Cullowhee, NC 28723, USA (Autor), Stiles, William; Department of Mathematics and Statistics, University of North Carolina at Greensboro 116 Petty Building, PO Box 26170, Greensboro, NC 27402, USA (Autor)
Format: EJournal Article
Publicat: GTA Research Group, Univ. Newcastle, Indonesian Combinatorics Society and ITB, 2021-10-16.
Matèries:
Accés en línia:Get Fulltext
Etiquetes: Afegir etiqueta
Sense etiquetes, Sigues el primer a etiquetar aquest registre!

Internet

Get Fulltext

3rd Floor Main Library

Detall dels fons de 3rd Floor Main Library
Signatura: A1234.567
Còpia 1 Disponible