Ilan Karpas

activity

20152017

most citedTwo Results on Union-Closed Families

5 citations · 7 across the 5 of their papers we have counts for

collaborators

Showing 2016Show all

2 papers · 1 filter

math.CO2016

On Vertex Rankings of Graphs and its Relatives

Ilan Karpas, Ofer Neiman, Shakhar Smorodinsky

A vertex ranking of a graph is an assignment of ranks (or colors) to the vertices of the graph, in such a way that any simple path connecting two vertices of equal rank, must conta…

cs.CC2016

Lower bounds for sensitivity of graph properties

Ilan Karpas

We prove that the sensitivity of any non-trivial graph property on $n$ vertices is at least $⌊ \frac{1}{2} n ⌋$ , provided $n$ is sufficiently large.