Laura Eslava

activity

20132022

most citedHigh degrees of random recursive trees

14 citations · 33 across the 9 of their papers we have counts for

collaborators

Showing math.COShow all

2 papers · 1 filter

math.CO2020★ 2 cited

The balancing number and list balancing number of some graph classes

Antoine Dailly, Adriana Hansberg, Laura Eslava +1

Given a graph $G$ , a 2-coloring of the edges of $K_{n}$ is said to contain a balanced copy of $G$ if we can find a copy of $G$ such that half of its edges is in each color class. If…

math.CO2015★ 14 cited

High degrees of random recursive trees

Louigi Addario-Berry, Laura Eslava

For $n \geq 1$ , let $T_{n}$ be a random recursive tree on the vertex set $[n] = {1, \dots, n}$ . Let $deg_{T_{n}} (v)$ be the degree of vertex $v$ in $T_{n}$ , that is, the number of…