A recursive Lovász theta number for simplex-avoiding sets

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 \(...

Full description

Saved in:
Bibliographic Details
Published in:arXiv.org 2022-05
Main Authors: Castro-Silva, Davi, Fernando Mário de Oliveira Filho, Slot, Lucas, Vallentin, Frank
Format: Article
Language:English
Subjects:
Euclidean geometry
Euclidean space
Graph theory
Upper bounds
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary: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\)-simplex is exponentially Ramsey, and we improve existing bounds for the base of the exponential.
ISSN:2331-8422
DOI:10.48550/arxiv.2106.09360