Back to matchesWe found a matchYour institution may have rights to this item. Sign in to continue.TitleExponential Lower Bound for Berge-Ramsey Problems.AuthorsPálvölgyi, DömötörAbstractWe give an exponential lower bound for the smallest N such that no matter how we c-color the edges of a complete r -uniform hypergraph on N vertices, we can always find a monochromatic Berge- K n .SubjectsRAMSEY theory; RAMSEY numbers; HYPERGRAPHSPublicationGraphs & Combinatorics, 2021, Vol 37, Issue 4, p1433ISSN0911-0119Publication typeArticleDOI10.1007/s00373-021-02328-3