Catching a robber on a random k-uniform hypergraph

DOI10.4153/S0008414X24000270MaRDI QIDQ6512204arXivFDO

Authors Joshua Erde, Mihyun Kang, Florian Lehner, Bojan Mohar, Dominik Schmid

Published in arXiv

Full work available at URL https://doi.org/10.4153/S0008414X24000270

Mathematics Subject Classification ID

Games on graphs (graph-theoretic aspects) (05C57) Random graphs (graph-theoretic aspects) (05C80)

This page was built for publication: Catching a robber on a random $k$-uniform hypergraph

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6512204)