N. Linial

collaborators

7 papers

math.CO2026

Metric Approximations of Consistent Path Systems

Daniel Cizma, Nati Linial

A path system $P$ in a graph $G = (V, E)$ is a collection of paths, with exactly one path between any two vertices in $V$ . A path system is said to be consistent if it is cl…

math.CO2026

More Vertices of the Tristochastic Polytope

Nati Linial, Zur Luria, Maya Trakhtman

The $n \times n$ doubly stochastic matrices constitute a polytope in $R^{n^{2}}$ , and by Birkhoff's theorem, its vertex set coincides with the set of order- $n$ permutation ma…

math.CO2025

Time to Cycle

Nir Lavee, Nati Linial

Consider the random process that starts with $n$ vertices and no edges, where the edges of $K_{n}$ are added one at a time in a uniformly chosen random order $e_1, e_2,\ldots, e_{\bi…

math.CO2025

On the Number of Path Systems

Daniel Cizma, Nati Linial

A path system in a graph $G$ is a collection of paths, with exactly one path between any two vertices in $G$ . A path system is said to be consistent if it is intersection-closed. W…

cs.IT2025

Bounds on Unique-Neighbor Codes

Nati Linial, Edan Orzech

Recall that a binary linear code of length $n$ is a linear subspace $C = {x \in F_{2}^{n} ∣ A x = 0}$ . Here the parity check matrix $A$ is a binary $m \times n$ matrix…

math.CO2025

Strictly Metrizable Graphs are Minor-Closed

Maria Chudnovsky, Daniel Cizma, Nati Linial

A consistent path system in a graph $G$ is an collection of paths, with exactly one path between any two vertices in $G$ . A path system is said to be consistent if it is intersecti…