Y. Peled

activity

20122026

most citedExtremal problems on shadows and hypercuts in simplicial complexes

9 citations · 16 across the 21 of their papers we have counts for

collaborators

Showing 2018Show all

3 papers · 1 filter

math.CO2018

Expander Graphs -- Both Local and Global

Michael Chapman, Nati Linial, Yuval Peled

Let $G = (V, E)$ be a finite graph. For $v \in V$ we denote by $G_{v}$ the subgraph of $G$ that is induced by $v$ 's neighbor set. We say that $G$ is $(a, b)$ -regular for $a > b > 0$ integers,…

math.CO2018

On simple connectivity of random 2-complexes

Zur Luria, Yuval Peled

The fundamental group of the $2$ -dimensional Linial-Meshulam random simplicial complex $Y_{2} (n, p)$ was first studied by Babson, Hoffman and Kahle. They proved that the threshold pro…

math.CO2018

Enumeration and randomized constructions of hypertrees

Nati Linial, Yuval Peled

Over thirty years ago, Kalai proved a beautiful $d$ -dimensional analog of Cayley's formula for the number of $n$ -vertex trees. He enumerated $d$ -dimensional hypertrees weighted by…