Lovász, László (2024) The matroid of a graphing. JOURNAL OF COMBINATORIAL THEORY SERIES B, 169. pp. 542-560. ISSN 0095-8956
|
Text
1-s2.0-S0095895624000674-main.pdf - Published Version Available under License Creative Commons Attribution Non-commercial No Derivatives. Download (400kB) | Preview |
Official URL: https://doi.org/10.1016/j.jctb.2024.08.001
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.
| Item Type: | Article |
|---|---|
| Uncontrolled Keywords: | Matroid; Graph limits; graphing; Submodular setfunction; |
| Subjects: | Q Science / természettudomány > QA Mathematics / matematika |
| SWORD Depositor: | MTMT SWORD |
| Depositing User: | MTMT SWORD |
| Date Deposited: | 07 May 2025 09:13 |
| Last Modified: | 07 May 2025 09:18 |
| URI: | https://real.mtak.hu/id/eprint/218619 |
Actions (login required)
 |
Edit Item |
