Colorings of hypergraphs with large number of colors

详细信息    查看全文

• 作者：Ilia Akolzin¹ ; ^{iakolzin@gmail.com" class="auth_mail" title="E-mail the corresponding author}
• 关键词：colorings of hypergraphs ; property B problem ; Tur&aacute ; n number
• 刊名：Electronic Notes in Discrete Mathematics
• 出版年：2015
• 出版时间：November 2015
• 年：2015
• 卷：49
• 期：Complete
• 页码：407-411
• 全文大小：186 K

文摘

The paper deals with the well-known problem of Erdős and Hajnal concerning colorings of uniform hypergraphs and some related questions. Let m(n,r)$m(n,r)$ denote the minimum possible number of edges in an n-uniform non-r  -colorable hypergraph. We show that for r<n$r<n$, where c₁$c_1$, C₁>0$C_1>0$ are some absolute constants.