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

5 papers

math.CO2017★ 5 cited

Two Results on Union-Closed Families

Ilan Karpas

We show that there is some absolute constant $c > 0$ , such that for any union-closed family $F \subseteq 2^{[n]}$ , if \mbox{ $∣ F ∣ \geq (\frac{1}{2} - c) 2^{n}$ }, then t…

math.CO2017★ 2 cited

Virtually fibering random right-angled Coxeter groups

Gonzalo Fiz Pontiveros, Roman Glebov, Ilan Karpas

We show that the Right-Angled Coxeter group $C = C (G)$ associated to a random graph $G \sim G (n, p)$ with $\frac{l o g n + l o g l o g n + ω ( 1 )}{n} \leq p < 1 - ω (n^{- 2})$ virtual…

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.

math.CO2015

Set families with a forbidden pattern

Ilan Karpas, Eoin Long

A balanced pattern of order $2 d$ is an element $P \in {+, -}^{2 d}$ , where both signs appear $d$ times. Two sets $A, B \subset [n]$ form $P$ -pattern, which we denote by $\operatorna…