1 citations · 1 across the 2 of their papers we have counts for
4 papers
2-colouring shift-chains
Zak Smith
A shift-chain is an -uniform hypergraph on vertex set with the property that, for any two edges and $ \{ f_1, \ldots, f_r \}…
Fractional clique decompositions in random hypergraphs
Felix Joos, Zak Smith
We prove that, whenever , with high probability admits a fractional triangle decomposition, that is, a non-negative weight function on its tria…
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…
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…