Daniel Cizma

activity

20202026

collaborators

Showing math.COShow all

6 papers · 1 filter

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.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…

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…

math.CO2023

The Structure of Metrizable Graphs

Maria Chudnovsky, Daniel Cizma, Nati Linial

A consistent path system in a graph $G$ is an intersection-closed collection of paths, with exactly one path between any two vertices in $G$ . We call $G$ metrizable if every consis…

math.CO2021

Irreducible Non-Metrizable Path Systems in Graphs

Daniel Cizma, Nati Linial

A path system $P$ in a graph $G = (V, E)$ is said to be irreducible if there does not exist a partition $V = A ⊔ B$ such that $P$ restricts to a path system on…

math.CO2020

Geodesic Geometry on Graphs

Daniel Cizma, Nati Linial

We investigate a graph theoretic analog of geodesic geometry. In a graph $G = (V, E)$ we consider a system of paths $P = {P_{u, v} ∣ u, v \in V}$ where $P_{u, v}$ connects vertice…