activity
20082018
most citedCrossing numbers of complete tripartite and balanced complete multipartite graphs

22 citations · 28 across the 6 of their papers we have counts for

collaborators

6 papers

math.CO2018

Realization Spaces of Uniform Phased Matroids

Amanda Ruiz

A phased matroid is a matroid with additional structure which plays the same role for complex vector arrangements that oriented matroids play for real vector arrangements. The real…

math.CO2015★ 2 cited

Discrete Envy-free Division of Necklaces and Maps

Roberto Barrera, Kathryn Nyman, Amanda Ruiz +2

We study the discrete variation of the classical cake-cutting problem where n players divide a 1-dimensional cake with exactly (n-1) cuts, replacing the continuous, infinitely divi…

math.CO2014★ 22 cited

Crossing numbers of complete tripartite and balanced complete multipartite graphs

Ellen Gethner, Leslie Hogben, Bernard Lidický +3

The crossing number cr(G) of a graph G is the minimum number of crossings in a nondegenerate planar drawing of G. The rectilinear crossing number cr'(G) of G is the minimum number…

math.CO2014★ 1 cited

Parking functions, Shi arrangements, and mixed graphs

Matthias Beck, Ana Berrizbeitia, Michael Dairyko +3

The \emph{Shi arrangement} is the set of all hyperplanes in of the form or for . Shi observed in 1986 that the number of region…

math.CO2012

The combinatorics of interval-vector polytopes

Matthias Beck, Jessica De Silva, Gabriel Dorfsman-Hopkins +2

An \emph{interval vector} is a -vector in for which all the 1's appear consecutively, and an \emph{interval-vector polytope} is the convex hull of a set of in…

math.CO2008★ 3 cited

When do two planted graphs have the same cotransversal matroid?

Federico Ardila, Amanda Ruiz

Cotransversal matroids are a family of matroids that arise from planted graphs. We prove that two planted graphs give the same cotransversal matroid if and only if they can be obta…