Cite

HARVARD Citation

    Abyazi Sani, R. et al. (2018). A new lower bound for the chromatic number of general Kneser hypergraphs. European journal of combinatorics. pp. 229-245. [Online]. 
  
Back to record