A recursive Lovász theta number for simplex-avoiding sets
Proceedings of the American Mathematical Society(2022)
摘要
We recursively extend the Lovász theta number to geometric hypergraphs on the unit sphere and on Euclidean space, obtaining an upper bound for the independence ratio of these hypergraphs. As an application we reprove a result in Euclidean Ramsey theory in the measurable setting, namely that every k k -simplex is exponentially Ramsey, and we improve existing bounds for the base of the exponential.
更多查看译文
关键词
recursive lovász theta number,simplex-avoiding
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要