C. Pelekis

activity

20132023

most citedA limit theorem for small cliques in inhomogeneous random graphs

10 citations · 34 across the 19 of their papers we have counts for

collaborators

Showing 2019 · math.CAShow all

2 papers · 2 filters

math.CA2019

On $k$ -antichains in the unit $n$ -cube

Christos Pelekis, Václav Vlasák

A \emph{chain} in the unit $n$ -cube is a set $C \subset [0, 1]^{n}$ such that for every $x = (x_{1}, \dots, x_{n})$ and $y = (y_{1}, \dots, y_{n})$ in $C$ we either have $x_i\le y_…

math.CA2019

A continuous analogue of Erdős' $k$ -Sperner theorem

Themis Mitsis, Christos Pelekis, Václav Vlasák

A \emph{chain} in the unit $n$ -cube is a set $C \subset [0, 1]^{n}$ such that for every $x = (x_{1}, \dots, x_{n})$ and $y = (y_{1}, \dots, y_{n})$ in $C$ we either have $x_i\le y_…

On k-antichains in the unit n-cube

A continuous analogue of Erdős' k-Sperner theorem

On $k$ -antichains in the unit $n$ -cube

A continuous analogue of Erdős' $k$ -Sperner theorem