Orthogonality and minimality in the homology of locally finite graphs
Reinhard Diestel, Julian Pott

TL;DR
This paper proves that orthogonality relations between certain subspaces of the edge space hold in 3-connected locally finite graphs, extending finite case results to infinite graphs and solving a known problem.
Contribution
It establishes orthogonality properties for homology-related subspaces in infinite graphs, specifically for 3-connected locally finite graphs, which was previously unresolved.
Findings
Orthogonality holds for six key subspaces in infinite graphs.
Extends finite graph homology results to infinite, locally finite graphs.
Solves a previously open problem in graph homology theory.
Abstract
Given a finite set , a subset (viewed as a function ) is orthogonal to a given subspace of the -vector space of functions as soon as is orthogonal to every -minimal element of . This fails in general when is infinite. However, we prove the above statement for the six subspaces of the edge space of any 3-connected locally finite graph that are relevant to its homology: the topological, algebraic, and finite cycle and cut spaces. This solves a problem of [5]
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
