Regular behavior of the maximal hypergraph chromatic number

From MaRDI portal
Publication:3300758

DOI10.1137/19M1281861zbMATH Open1444.05055arXiv1808.01482OpenAlexW3034387541MaRDI QIDQ3300758FDOQ3300758


Authors: Danila Cherkashin, F. V. Petrov Edit this on Wikidata


Publication date: 30 July 2020

Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)

Abstract: Let m(n,r) denote the minimal number of edges in an n-uniform hypergraph which is not r-colorable. It is known that for a fixed n one has [ c_n r^n < m(n,r) < C_n r^n. ] We prove that for any fixed n the sequence ar:=m(n,r)/rn has a limit, which was conjectured by Alon. We also prove the list colorings analogue of this statement.


Full work available at URL: https://arxiv.org/abs/1808.01482




Recommendations




Cites Work


Cited In (4)





This page was built for publication: Regular behavior of the maximal hypergraph chromatic number

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3300758)