P. ErdHos

collaborators

3 papers

math.CO2025

Any fully graphic region of degree sequences can be sampled rapidly

PÃ©ter L. ErdÅs, GÃ¡bor Lippner, Na'ama Nevo +1

Let $n > c_{1} \geq c_{2}$ and $I^£$ be positive integers with $n \cdot c_{1} \geq I^£ \geq n \cdot c_{2} .$ Let $\mD=\dds{n}Î£{c_1}{c_2}$ denote the set of all degree sequences of length $n$ with the…

math.CO2025

Nearly equal distances in the plane, II

P. ErdÅs, E. Makai, J. Pach

Let ${p_{1}, \dots, p_{n}} \subset R^{2}$ be a separated point set, i.e., any two points have a distance at least $1$ . Let $k \geq 1$ be an integer, and $1 \le t_1 < \ldots <…

math.MG2025

Two nearly equal distances in $R^{d}$

P. ErdÅs, E. Makai, J. Pach

A point set $P \subset R^{d}$ is {\it separated} if the minimum distance between any two points in $P$ is at least $1$ . For $d \neq = 4, 5,$ we determine, for every $t_1,t_2 \ge…

Any fully graphic region of degree sequences can be sampled rapidly

Nearly equal distances in the plane, II

Two nearly equal distances in Rd

Two nearly equal distances in $R^{d}$