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 math.COShow all

6 papers · 1 filter

math.CO2023

A binomial random multigraph

Christos Pelekis

Fix a positive integer $n$ , a real number $p \in (0, 1]$ , and a (perhaps random) hypergraph $H$ on $[n]$ . We introduce and investigate the following random multigraph model…

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…

math.CO2018★ 7 cited

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…