Harmonious coloring of uniform hypergraphs

Tytuł:
Harmonious coloring of uniform hypergraphs
Czasopismo:
Rok:
2016

Opis:
A harmonious coloring of a k-uniform hypergraph H is a vertex coloring such that no two vertices in the same edge share the same color, and each k-element subset of colors appears on at most one edge. The harmonious number h(H) is the least number of colors needed for such a coloring. We prove that k-uniform hypergraphs of bounded maximum degree Delta satisfy h(H) = O((k)root k!m), where m is the number of edges in H which is best possible up to a multiplicative constant. Moreover, for every fix

Strony:
73-87

Tom (seria wydawnicza):
10 (1)

Numer DOI:
10.2298/AADM160411008B

Link:
http://pefmath.etf.bg.ac.rs/vol10num1/AADM-Vol10-No1-73-87.pdf

Web of science link:
http://apps.webofknowledge.com/full_record.do?product=WOS&search_mode=GeneralSearch&qid=5&SID=Q2yPRzipnKbRUV7Zm1E&page=1&doc=1

Mathscinet link:
http://www.ams.org/mathscinet/search/publdoc.html?arg3=&co4=AND&co5=AND&co6=AND&co7=AND&dr=all&pg4=AUCN&pg5=TI&pg6=PC&pg7=ALLF&pg8=ET&review_format=html&s4=bosek%2C%20B%2A&s5=&s6=&s7=&s8=All&sort=Newest&vfpref=html&yearRangeFirst=&yearRangeSecond=&yrop=eq