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 2019Show all

4 papers · 1 filter

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_…

math.CO2019

A Turán-type theorem for large-distance graphs in Euclidean spaces, and related isodiametric problems

Martin Doležal, Jan Hladký, Jan Kolář +3

Given a measurable set $A \subset R^{d}$ we consider the "large-distance graph" $G_{A}$ , on the ground set $A$ , in which each pair of points from $A$ whose distance is…

math.CO2019★ 10 cited

A limit theorem for small cliques in inhomogeneous random graphs

Jan Hladky, Christos Pelekis, Matas Sileikis

The theory of graphons comes with a natural sampling procedure, which results in an inhomogeneous variant of the Erdős--Rényi random graph, called $W$ -random graphs. We prove, via…

On k-antichains in the unit n-cube

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

A Turán-type theorem for large-distance graphs in Euclidean spaces, and related isodiametric problems

A limit theorem for small cliques in inhomogeneous random graphs

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

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