4 papers
The balanced upper chromatic number of linear hypergraphs and the -cube over elements
Gabriela Araujo-Pardo, Silvia Fernández-Merchant, Adriana Hansberg +3
A coloring of the vertices of a hypergraph is called \emph{balanced} if the sizes of the color classes differ by at most one. We say that a hyperedge is \emph{rainbow} if its eleme…
Tverberg Partition Graphs
Deborah Oliveros, Érika Roldán, Pablo Soberón +1
Given a finite set of points in , Tverberg's theorem guarantees the existence of partitions of this set into parts whose convex hulls intersect. We introduce a graph…
A Model for Birdwatching and other Chronological Sampling Activities
Jesús A. De Loera, Edgar Jaramillo-Rodriguez, Deborah Oliveros +1
In many real life situations one has types of random events happening in chronological order within a time interval and one wishes to predict various milestones about these eve…
A note on the intersection property for flat boxes and boxicity in
Hector Baños, Déborah Oliveros
By extending the definition of boxicity, we extend a Helly-type result given by Danzer and Grumbaum on 2-piercings of family of boxes in -dimensional Euclidian space by lowering…