Jessica De Silva

most citedIncreasing paths in edge-ordered graphs: the hypercube and random graphs

4 citations · 4 across the 1 of their papers we have counts for

collaborators

2 papers

math.CO2018

An analysis of a fair division protocol for drawing legislative districts

Jessica De Silva, Brady Gales, Bryson Kagy +1

Landau, Reid, and Yershov [A Fair Division Solution to the Problem of Redistricting, \textit{Social Choice and Welfare}, 2008] propose a protocol for drawing legislative districts…

math.CO2015★ 4 cited

Increasing paths in edge-ordered graphs: the hypercube and random graphs

Jessica De Silva, Theodore Molla, Florian Pfender +2

An edge-ordering of a graph $G = (V, E)$ is a bijection $ϕ : E \to {1, 2, ..., ∣ E ∣}$ . Given an edge-ordering, a sequence of edges $P = e_{1}, e_{2}, ..., e_{k}$ is an increasing path if it is a path…