N. Linial

activity

20082026

most citedA Note on the Inducibility of 4-vertex Graphs

38 citations · 173 across the 31 of their papers we have counts for

collaborators

Showing 2014 · math.COShow all

2 papers · 2 filters

math.CO2014★ 9 cited

Extremal problems on shadows and hypercuts in simplicial complexes

Nati Linial, Ilan Newman, Yuval Peled +1

Let $F$ be an $n$ -vertex forest. We say that an edge $e \in / F$ is in the shadow of $F$ if $F \cup {e}$ contains a cycle. It is easy to see that if $F$ is "almost a tree", that is…

math.CO2014★ 1 cited

On the number of 4-cycles in a tournament

Nati Linial, Avraham Morgenstern

If $T$ is an $n$ -vertex tournament with a given number of $3$ -cycles, what can be said about the number of its $4$ -cycles? The most interesting range of this problem is where $T$ i…