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.LO2021
Minimal vertex covers in infinite hypergraphs
Tamás Csernák, Lajos Soukup
In this paper a hypergraph will be identified with the family of its edges. A hypergraph possesses property iff for each $\mathcal E…