activity
20092024
most citedBeyond Chance-Constrained Convex Mixed-Integer Optimization: A Generalized Calafiore-Campi Algorithm and the notion of -optimization

7 citations · 19 across the 18 of their papers we have counts for

collaborators
Showing 2014Show all

5 papers · 1 filter

math.MG2014★ 6 cited

A fractional Helly theorem for boxes

I. Bárány, F. Fodor, A. Martínez-Pérez +3

Let be a family of axis-parallel boxes in and a real number. There exists a real number such that if there are $α{n\choos…

math.CO2014

Colorful Associahedra and Cyclohedra

Gabriela Araujo-Pardo, Isabel Hubard, Deborah Oliveros +1

Every n-edge colored n-regular graph G naturally gives rise to a simple abstract n-polytope, the colorful polytope of G, whose 1-skeleton is isomorphic to G. The paper describes co…

math.CO2014★ 1 cited

The (p,q)-extremal problem and the fractional chromatic number of Kneser hypergraphs

Gabriela Araujo-Pardo, Juan Carlos Díaz-Patiño, Luis Montejano +1

The problem of computing the chromatic number of Kneser hypergraphs has been extensively studied over the last 40 years and the fractional version of the chromatic number of Kneser…

math.CO2014

A Rainbow Ramsey Analogue of Rado's Theorem

Jesús A. De Loera, Reuben N. La Haye, Amanda Montejano +2

We present a Rainbow Ramsey version of the well-known Ramsey-type theorem of Richard Rado. We use techniques from the Geometry of Numbers. We also disprove two conjectures proposed…

math.CO2014

The chromatic number of comparability 3-hypergraphs

Natalia Garcia-Colin, Amanda Montejano, Deborah Oliveros

Beginning with the concepts of orientation for a 3-hypergraph and transitivity for an oriented 3-hypergraph, it is natural to study the class of comparability 3-hypergraphs (those…