Author:
Aslam Jai,Chen Shuli,Coldren Ethan,Frick Florian,Setiabrata Linus
Funder
National Science Foundation
Subject
Computational Theory and Mathematics,Discrete Mathematics and Combinatorics,Theoretical Computer Science
Reference18 articles.
1. A new lower bound for the chromatic number of general Kneser hypergraphs;Abyazi Sani;European J. Combin.,2018
2. On the chromatic number of general Kneser hypergraphs;Alishahi;J. Combin. Theory Ser. B,2015
3. Stable Kneser hypergraphs and ideals in N with the Nikodym property;Alon;Proc. Amer. Math. Soc.,2009
4. The chromatic number of Kneser hypergraphs;Alon;Trans. Amer. Math. Soc.,1986
5. Optimal bounds for the colored Tverberg problem;Blagojević;J. Eur. Math. Soc. (JEMS),2015
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献