4 citations · 7 across the 12 of their papers we have counts for
Showing 2025Show all
2 papers · 1 filter
math.CO2025
Infinitely many counterexamples to a conjecture of Lovász
Aida Abiad, Frederik Garbe, Xavier Povill +1
Motivated by the well-known conjecture of Ryser which relates maximum matchings to minimum vertex covers in -partite -uniform hypergraphs, Lovász formulated a stronger conjec…
math.CO2025
Graph factors and powers of Hamilton cycles in the budget-constrained random graph process
Alberto Espuny Díaz, Frederik Garbe, Tássio Naia +1
We consider the following budget-constrained random graph process introduced by Frieze, Krivelevich and Michaeli. A player, called Builder, is presented with distinct edges of…