1 citations · 1 across the 2 of their papers we have counts for
2 papers
math.CO2026
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…
math.CO2026★ 1 cited
Conflict-free Hypergraph Matchings and Coverings
Felix Joos, Dhruv Mubayi, Zak Smith
Recent work showing the existence of conflict-free almost-perfect hypergraph matchings has found many applications. We show that, assuming certain simple degree and codegree condit…