Publication
A Polynomial Regularity Lemma For Semialgebraic Hypergraphs And Its Applications In Geometry And Property Testing
Abstract
In this paper, we prove several extremal results for geometrically defined hypergraphs. In particular, we establish an improved lower bound, single exponentially decreasing in k, on the best constant delta > 0 such that the vertex classes P-1,...,P-k of every k -partite k -uniform semialgebraic hypergraph H = (P-1 U center dot center dot center dot U P-k, E) with vertical bar E vertical bar >= epsilon ll(j=1)(k) vertical bar P-i vertical bar have, for 1
Official source
About this result
This page is automatically generated and may contain information that is not correct, complete, up-to-date, or relevant to your search query. The same applies to every other page on this website. Please make sure to verify the information with EPFL's official sources.