Anti-Ramsey Hypergraph Numbers

Mark Budden, William Stiles


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.


hyperedge coloring; paths; stars

Full Text:




A. Bialostocki, A. Gilboa and Y. Roditty, Anti-Ramsey numbers of small graphs, Ars Combin. 123 (2015), 41–53.

M. Budden, J. Hiller, and A. Rapp, Generalized Ramsey theorems for r-uniform hypergraphs, Australas. J. Combin. 63(1) (2015), 142–152. v63 p142.pdf

G. Chartrand and P. Zhang, Chromatic graph theory, Chapman and Hall, 2008.

P. Erdos, M. Simonovits and V. Sos, Anti-Ramsey theorems, ´ Colloquia Mathematica Societatis Janos Bolyai 10 (1973), 633–643.

S. Gilboa, and Y. Roditty, Anti-Ramsey numbers of graphs with small connected components, Graphs Combin. 32 (2016), 649–662.

T. Jiang, Edge-colorings with no large polychromatic stars, Graphs Combin. 18 (2002), 303–308.

L. Ozkahya and M. Young, Anti-Ramsey number of matchings in hypergraphs, Discrete Math. 313 (2013), 2359–2364.

I. Schiermeyer, Rainbow numbers for matchings and complete graphs, Discrete Math. 286 (2004), 157–162.


  • There are currently no refbacks.

ISSN: 2338-2287

Creative Commons License
This work is licensed under a Creative Commons Attribution-ShareAlike 4.0 International License.

View EJGTA Stats