Abstract
AbstractThe aim of this paper is to apply the framework developed by Sam and Snowden to study structural properties of graph homologies, in the spirit of Ramos, Miyata and Proudfoot. Our main results concern the magnitude homology of graphs introduced by Hepworth and Willerton, and we prove that it is a finitely generated functor (on graphs of bounded genus). More precisely, for graphs of bounded genus, we prove that magnitude cohomology, in each homological degree, has rank which grows at most polynomially in the number of vertices, and that its torsion is bounded. As a consequence, we obtain analogous results for path homology of (undirected) graphs.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
