2019/06/10 by Pálvölgyi, Dömötör#Combinatorics (math.CO) #FOS: Mathematics
paper · doi:10.48550/arxiv.1906.04288
We give an exponential lower bound for Berge-Ramsey problems.