Abstract
Graphings serve as limit objects for bounded-degree graphs. We define the “cycle matroid” of a graphing as a submodular setfunction, with values in [0,1], which generalizes (up to normalization) the cycle matroid of finite graphs. We prove that for a Benjamini–Schramm convergent sequence of graphs, the total rank, normalized by the number of nodes, converges to the total rank of the limit graphing.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: 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.