38 citations · 173 across the 31 of their papers we have counts for
4 papers · 1 filter
Time to Cycle
Nir Lavee, Nati Linial
Consider the random process that starts with vertices and no edges, where the edges of are added one at a time in a uniformly chosen random order $e_1, e_2,\ldots, e_{\bi…
On the Number of Path Systems
Daniel Cizma, Nati Linial
A path system in a graph is a collection of paths, with exactly one path between any two vertices in . A path system is said to be consistent if it is intersection-closed. W…
Strictly Metrizable Graphs are Minor-Closed
Maria Chudnovsky, Daniel Cizma, Nati Linial
A consistent path system in a graph is an collection of paths, with exactly one path between any two vertices in . A path system is said to be consistent if it is intersecti…
Higher-order Delsarte Dual LPs: Lifting, Constructions and Completeness
Leonardo Nagami Coregliano, Fernando Granha Jeronimo, Chris Jones +2
A central and longstanding open problem in coding theory is the rate-versus-distance trade-off for binary error-correcting codes. In a seminal work, Delsarte introduced a family of…