A note on increasing paths in countable hypergraphs
From MaRDI portal
Abstract: An old result of M"uller and R"odl states that a countable graph has a subgraph whose vertices all have infinite degree if and only if for any vertex labeling of by positive integers, an infinite increasing path can be found. They asked whether an analogous equivalence holds for edge labelings, which Reiterman answered in the affirmative. Recently, Arman, Elliott, and R"odl extended this problem to linear -uniform hypergraphs and generalized the original equivalence for vertex labelings. They asked whether Reiterman's result for edge labelings can similarly be extended. We confirm this for the case where admits only finitely many Berge cycles.
This page was built for publication: A note on increasing paths in countable hypergraphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6389030)
