48 citations · 91 across the 23 of their papers we have counts for
14 papers · 1 filter
Crossing numbers of simplicial complexes
Alfredo Hubard, Cheikh Saliou Ndiaye, Oriol Solé-Pi
This paper studies crossing numbers of -dimensional simplicial complexes drawn in or . We clarify and generalize a number of known results and c…
Overlap-Helly theorems
Andreas F. Holmsen, Alfredo Hubard
In this paper we introduce a generalization of Helly's theorem closely connected to Bárány-Gromov overlap theorems (also called selection lemmas). Our main result implies both the…
Crossing numbers of dense graphs on surfaces
Alfredo Hubard, Arnaud de Mesmay, Hugo Parlier
In this paper, we provide upper and lower bounds on the crossing numbers of dense graphs on surfaces, which match up to constant factors. First, we prove that if is a dense eno…
Cubulating the sphere with many facets
Sergey Avvakumov, Alfredo Hubard
For each we construct cube complexes homeomorphic to the -sphere with vertices in which the number of facets (assuming constant) is . This disprove…
Bisecting masses with families of parallel hyperplanes
Alfredo Hubard, Pablo Soberón
We prove a common generalization of several mass partition results using hyperplane arrangements to split into two sets. Our main result implies the ham sandwich the…
Crossing lemmas for -systems of arcs
Alfredo Hubard, Hugo Parlier
We show a generalization of the crossing lemma for multi-graphs drawn on orientable surfaces in which pairs of edges are assumed to be drawn by non-homotopic simple arcs which pair…
Disjoint faces in simple drawings of the complete graph and topological Heilbronn problems
Alfredo Hubard, Andrew Suk
Given a complete simple topological graph , a -face generated by is the open bounded region enclosed by the edges of a non-self-intersecting -cycle in . Interesting…
Limits of Order Types
Xavier Goaoc, Alfredo Hubard, Rémi de Joannis de Verclos +2
We apply ideas from the theory of limits of dense combinatorial structures to study order types, which are combinatorial encodings of finite point sets. Using flag algebras we obta…
On a topological version of Pach's overlap theorem
Boris Bukh, Alfredo Hubard
Pach showed that every sets of points contain linearly-sized subsets such that all the transversal simplices that t…
Discrete Systolic Inequalities and Decompositions of Triangulated Surfaces
Éric Colin de Verdière, Alfredo Hubard, Arnaud de Mesmay
How much cutting is needed to simplify the topology of a surface? We provide bounds for several instances of this question, for the minimum length of topologically non-trivial clos…
The Erdős-Szekeres problem for non-crossing convex sets
Michael G Dobbins, Andreas F Holmsen, Alfredo Hubard
We show an equivalence between a conjecture of Bisztriczky and Fejes T{ó}th about arrangements of planar convex bodies and a conjecture of Goodman and Pollack about point sets in t…
Space crossing numbers
Boris Bukh, Alfredo Hubard
We define the crossing number for an embedding of a graph G into R^3, and prove a lower bound on it which almost implies the classical crossing lemma. We also give sharp bounds on…
Slicing convex sets and measures by a hyperplane
Imre Barany, Alfredo Hubard, Jesus Jeronimo
We generalize the ham sandwich theorem for the case of well separated measures. Given convex bodies in and numbers , we give a…
Order Types of convex bodies
Alfredo Hubard, Luis Montejano, Emiliano Mora +1
We give new bounds on the Erdos-Szekeres theorems for convex bodies of Bisztriczky and Fejes Toth and of Pach and Toth. We derive them from a combinatorial characterization of conv…