7 citations · 19 across the 18 of their papers we have counts for
15 papers · 1 filter
Borsuk and Vázsonyi problems through Reuleaux polyhedra
Gyivan Lopez-Campos, Deborah Oliveros, Jorge L. Ramírez Alfonsín
The Borsuk conjecture and the Vázsonyi problem are two attractive and famous questions in discrete and combinatorial geometry, both based on the notion of diameter of a bounded set…
From word-representable graphs to altered Tverberg-type theorems
Deborah Oliveros, Antonio Torres
Tverberg's theorem says that a set with sufficiently many points in can always be partitioned into parts so that the -simplex is the (nerve) intersection…
On weighted sums of numbers of convex polygons in point sets
Clemens Huemer, Deborah Oliveros, Pablo Pérez-Lantero +2
Let be a set of points in general position in the plane, and let be the number of convex -gons with vertices in that have exactly points of $S…
The geometry and combinatorics of discrete line segment hypergraphs
Deborah Oliveros, Christopher O'Neill, Shira Zerbib
An -segment hypergraph is a hypergraph whose edges consist of consecutive integer points on line segments in . In this paper, we bound the chromatic number…
A note on extremal results on directed acyclic graphs
A. Martínez-Pérez, L. Montejano, D. Oliveros
The family of Directed Acyclic Graphs as well as some related graphs are analyzed with respect to extremal behavior in relation with the family of intersection graphs for families…
Extremal results on intersection graphs of boxes in
A. Martínez-Pérez, L. Montejano, D. Oliveros
The main purpose of this paper is to study extremal results on the intersection graphs of boxes in . We calculate exactly the maximal number of intersecting pairs in a family…