Laurentiu Ploscaru

activity

20222026

most citedA bipartite version of the Erdős

-

McKay conjecture

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

collaborators

4 papers

math.MG2026

Many Antipodal Pairs Force Many Neighboring Pairs

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…

math.CO2022★ 1 cited

A bipartite version of the Erdős $-$ McKay conjecture

Eoin Long, Laurentiu Ploscaru

An old conjecture of Erdős and McKay states that if all homogeneous sets in an $n$ -vertex graph are of order $O (lo g n)$ then the graph contains induced subgraphs of each size from…

math.CO2022

Distinct degrees and homogeneous sets

Eoin Long, Laurentiu Ploscaru

In this paper we investigate the extremal relationship between two well-studied graph parameters: the order of the largest homogeneous set in a graph $G$ and the maximal number of…

Many Antipodal Pairs Force Many Neighboring Pairs

Distinct degrees and homogeneous sets II

A bipartite version of the Erdős − McKay conjecture

Distinct degrees and homogeneous sets

A bipartite version of the Erdős $-$ McKay conjecture