当前位置: X-MOL 学术Graphs Comb. › 论文详情
Our official English website, www.x-mol.net, welcomes your feedback! (Note: you will need to create a separate account there.)
Exponential Lower Bound for Berge-Ramsey Problems
Graphs and Combinatorics ( IF 0.7 ) Pub Date : 2021-05-14 , DOI: 10.1007/s00373-021-02328-3
Dömötör Pálvölgyi

We 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\).



中文翻译:

Berge-Ramsey问题的指数下界

我们举一个指数下界最小\(N \),这样,无论我们如何Ç -COLOR一个完整的边缘\(R \) -uniform超图上\(N \)的顶点,我们总能找到一个单色Berge- \(K_n \)

更新日期:2021-05-14
down
wechat
bug