Tamás Csernák

activity

20242026

collaborators

6 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.GN2026

Cut-and-choose games in topological spaces

Lucas Chiozini, TamÃ¡s CsernÃ¡k, Lajos Soukup

We study transfinite cut-and-choose games on $T_{0}$ spaces, introducing the {\em point-separating number} $p s (X)$ and the {\em set membership number} $s m (X)$ as the ordinal-valued…

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.CO2026

List Chromatic Number of Finitary Matroids: A Generalization of Seymour's Result

TamÃ¡s CsernÃ¡k

Seymour proved that the chromatic numbers and the list chromatic numbers of loop-free finite matroids are the same. In this paper we prove the same statement for infinite, loop-fre…

math.CO2025

On Proper Colorings of Functions

TamÃ¡s CsernÃ¡k

We investigate the infinite version of the $k$ -switch problem of Greenwell and LovÃ¡sz. Given infinite cardinals $I^º$ and $I^»$ , for functions $x, y \in^{I^} » I^º$ we say that they are…

math.CO2024

Trivial coloring of Cartesian product of graphs

TamÃ¡s CsernÃ¡k

A coloring of a direct product of graphs is said to be {\em trivial} iff it is induced by some coloring of a factor of the product. A graph $G$ is trivially power colorable iff eve…