activity
20122022
most citedChip-firing games on Eulerian digraphs and NP-hardness of computing the rank of a divisor on a graph

14 citations · 18 across the 6 of their papers we have counts for

collaborators
Showing 2017 · math.COShow all

1 paper · 2 filters

math.CO2017

On Ryser's conjecture for t-intersecting and degree-bounded hypergraphs

Zoltan Kiraly, Lilla Tothmeresz

A famous conjecture (usually called Ryser's conjecture) that appeared in the Ph.D thesis of his student, J.~R.~Henderson [15], states that for an -uniform -partite hypergraph…