1 citations · 2 across the 9 of their papers we have counts for
8 papers · 1 filter
More Vertices of the Tristochastic Polytope
Nati Linial, Zur Luria, Maya Trakhtman
The doubly stochastic matrices constitute a polytope in , and by Birkhoff's theorem, its vertex set coincides with the set of order- permutation ma…
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…
Larger Corner-Free Sets from Better NOF Exactly- Protocols
Nati Linial, Adi Shraibman
A subset of the integer planar grid is called corner-free if it contains no triple of the form . It is known that such a set has a vanishi…
Hyperpaths
Amir Dahari, Nati Linial
Hypertrees are high-dimensional counterparts of graph theoretic trees. They have attracted a great deal of attention by various investigators. Here we introduce and study Hyperpath…