TY - JOUR
T1 - Chain method for panchromatic colorings of hypergraphs
AU - Akhmejanova, Margarita
AU - Balogh, József
AU - Shabanov, Dmitrii
N1 - Publisher Copyright:
© 2022 Elsevier B.V.
PY - 2022/11/15
Y1 - 2022/11/15
N2 - We deal with an extremal problem concerning panchromatic colorings of hypergraphs. A vertex r-coloring of a hypergraph H is panchromatic if every edge meets every color. We prove that for every [Formula presented], every n-uniform hypergraph H with [Formula presented] has a panchromatic coloring with r colors, where c>0 is an absolute constant.
AB - We deal with an extremal problem concerning panchromatic colorings of hypergraphs. A vertex r-coloring of a hypergraph H is panchromatic if every edge meets every color. We prove that for every [Formula presented], every n-uniform hypergraph H with [Formula presented] has a panchromatic coloring with r colors, where c>0 is an absolute constant.
KW - Panchromatic coloring
KW - Proper coloring
KW - Property B
KW - Uniform hypergraph
UR - http://www.scopus.com/inward/record.url?scp=85133279354&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=85133279354&partnerID=8YFLogxK
U2 - 10.1016/j.dam.2022.06.005
DO - 10.1016/j.dam.2022.06.005
M3 - Article
AN - SCOPUS:85133279354
SN - 0166-218X
VL - 321
SP - 72
EP - 81
JO - Discrete Applied Mathematics
JF - Discrete Applied Mathematics
ER -