Laurentiu Ploscaru

collaborators

2 papers

math.MG2026

Many Antipodal Pairs Force Many Neighboring Pairs

GÃ¡bor DamÃ¡sdi, Gábor Damásdi, Laurentiu Ploscaru

Let $X = {x_{1}, \dots, x_{n}} \subset R^{2}$ be a finite set of points of diameter at most $1$ . It is natural to expect that if many pairs $(x_{i}, x_{j})$ lie at distance close to $1$ …

math.CO2024

Distinct degrees and homogeneous sets II

Eoin Long, Laurentiu Ploscaru

Given an $n$ -vertex graph $G$ , let $hom (G)$ denote the size of a largest homogeneous set in $G$ and let $f (G)$ denote the maximal number of distinct degrees appearing in an induc…