Overlap properties of geometric expanders
The overlap number of a finite (d + 1)-uniform hypergraph H is the largest constant c(H) ∈ (0, 1] such that no matter how we map the vertices of H into ℝ[superscript d], there is a point covered by at least a c(H)-fraction of the simplices induced by the images of its hyperedges. Motivated by the se...
Main Authors: | Fox, Jacob, Gromov, Mikhail, Lafforgue, Vincent, Naor, Assaf, Pach, Janos |
---|---|
Other Authors: | Massachusetts Institute of Technology. Department of Mathematics |
Format: | Article |
Language: | en_US |
Published: |
Walter de Gruyter
2013
|
Online Access: | http://hdl.handle.net/1721.1/80829 |
Similar Items
-
String graphs and incomparability graphs
by: Fox, Jacob, et al.
Published: (2015) -
The Number of Edges in k-Quasi-planar Graphs
by: Fox, Jacob, et al.
Published: (2013) -
Erdos-Szekeres-type theorems for monotone paths and convex bodies
by: Fox, Jacob, et al.
Published: (2021) -
Erdos-Szekeres-type theorems for monotone paths and convex bodies
by: Fox, Jacob, et al.
Published: (2012) -
On grids in topological graphs
by: Ackerman, Eyal, et al.
Published: (2017)