Lajos Soukup

activity

20242026

most citedFully graphic degree sequences and P-stable degree sequences

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

collaborators

5 papers

math.CO2026

An asymptotically tight bound on oriented diameter

Jiangdong Ai, Yaojun Chen, Yaokun Feng +5

Let $f (d)$ be the smallest integer such that every finite connected bridgeless simple graph of diameter $d$ admits a strong orientation of diameter at most $f (d)$ . Chvátal and Thom…

math.CO2026

Stacking and Clearing in Directed Graph Pebbling

Tamás Csernák, Lajos Soukup

Suppose that pebbles are distributed on the vertices of a directed graph D. A directed pebbling step u -> v along an arc u -> v removes two pebbles from u and places one pebble on…

math.CO2026

Stacking and clearing in graph pebbling

Tamás Csernák, Lajos Soukup

Suppose that pebbles are distributed on the vertices of a graph G. A pebbling step along an edge uv removes two pebbles from u and places one pebble on v. We introduce two new grap…

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 $Σ$ be positive integers with $n \cdot c_{1} \geq Σ \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 eve…

math.CO2024★ 1 cited

Fully graphic degree sequences and P-stable degree sequences

Péter L. Erdős, István Miklós, Lajos Soukup

The notion of $P$ -stability of an infinite set of degree sequences plays influential role in approximating the permanents, rapidly sampling the realizations of graphic degree seque…