C. Pelekis

activity

20162021

most citedSome inequalities on Binomial and Poisson probabilities

2 citations · 3 across the 4 of their papers we have counts for

collaborators

Showing math.COShow all

3 papers · 1 filter

math.CO2018

Projection inequalities for antichains

Konrad Engel, Themis Mitsis, Christos Pelekis +1

A set $A \subseteq R^{n}$ is called an antichain (resp. antichain) if it does not contain two distinct elements $x = (x_{1}, \dots, x_{n})$ and ${\mathbf y}=(y_1,\ldot…

math.CO2017

A generalization of Erdős' matching conjecture

Christos Pelekis, Israel Rocha

Let $H = (V, E)$ be an $r$ -uniform hypergraph on $n$ vertices and fix a positive integer $k$ such that $1 \leq k \leq r$ . A $k$ -\emph{matching} of $H$ is a c…

math.CO2017★ 1 cited

A fractal perspective on optimal antichains and intersecting subsets of the unit $n$ -cube

Konrad Engel, Themis Mitsis, Christos Pelekis

An \emph{ $n$ -cube antichain} is a subset of the unit $n$ -cube $[0, 1]^{n}$ that does not contain two elements $x = (x_{1}, x_{2}, \dots, x_{n})$ and $\mathbf{y}=(y_1, y_2,\ldots, y_n…

Projection inequalities for antichains

A generalization of Erdős' matching conjecture

A fractal perspective on optimal antichains and intersecting subsets of the unit n-cube

A fractal perspective on optimal antichains and intersecting subsets of the unit $n$ -cube