Lajos Soukup

collaborators

3 papers

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

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…