arxiv: 2605.12629 · v1 · submitted 2026-05-12 · 🧮 math.CO · math.GR

Recognition: 2 theorem links

· Lean Theorem

Relative accessibility for graphs

Joseph Paul MacManus

Authors on Pith no claims yet

Pith reviewed 2026-05-14 20:32 UTC · model grok-4.3

classification 🧮 math.CO math.GR

keywords relative accessibilitygraphsBoolean ringquasi-transitive graphsfinitely generated groupsquasi-isometry invariantperipheral systemcycle space

0 comments

The pith

Relative accessibility for graphs is characterized by a subring of the Boolean ring and matches the algebraic definition for groups.

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

The paper introduces a relative version of accessibility for graphs with respect to a peripheral system, extending the Thomassen-Woess definition. For locally finite quasi-transitive graphs it shows that this property holds exactly when a certain subring of the graph's Boolean ring satisfies a closure condition. The same characterization proves that the graph-theoretic notion coincides with the standard algebraic relative accessibility for finitely generated groups. As a direct consequence relative accessibility becomes a quasi-isometry invariant for such groups whenever the quasi-isometry coarsely preserves peripheral cosets, and a relative form of Hamann's theorem follows for graphs whose cycle spaces are finitely generated.

Core claim

Relative accessibility, defined by requiring that every peripheral system admits a finite collection of cuts whose removal leaves only one-ended components after deleting any finite set, is equivalent, in the locally finite quasi-transitive case, to the subring generated by the cuts being closed under the Boolean operations induced by the graph. This equivalence transfers directly to finitely generated groups, showing that the graph definition agrees with the usual algebraic one and therefore inherits quasi-isometry invariance under the stated coarse-preservation hypothesis.

What carries the argument

the subring of the Boolean ring of the graph consisting of all finite Boolean combinations of cuts that witness relative accessibility

If this is right

Relative accessibility is preserved by quasi-isometries that coarsely preserve peripheral cosets, so it is a quasi-isometry invariant for the corresponding finitely generated groups.
Any finitely generated group that is relatively accessible with respect to a peripheral system admits a graph model whose cycle space is finitely generated only when the relative accessibility condition holds.
The relative Hamann theorem supplies an accessibility criterion for graphs whose cycle spaces are finitely generated once the peripheral system is fixed.
The Boolean-ring characterization gives an algebraic test that can be checked directly on the cut space without enumerating all finite vertex sets.

Where Pith is reading between the lines

These are editorial extensions of the paper, not claims the author makes directly.

The same subring test may extend accessibility questions to graphs that are only coarsely quasi-transitive.
Because the invariance holds only under coset-preserving maps, other geometric equivalences such as coarse embeddings could produce new examples where relative accessibility changes.
The Boolean-ring description suggests that relative accessibility can be viewed as a finiteness condition inside the cut algebra, potentially linking it to other algebraic invariants of the graph.

Load-bearing premise

The graphs are locally finite and quasi-transitive, and any quasi-isometry under consideration coarsely preserves the left cosets of the peripheral subgroups.

What would settle it

A single locally finite quasi-transitive graph equipped with a peripheral system in which the Boolean subring fails to be closed yet every finite set of vertices still leaves only one-ended components after removal of the peripheral cuts.

Figures

Figures reproduced from arXiv: 2605.12629 by Joseph Paul MacManus.

**Figure 1.** Figure 1: Example of a thin peripheral system which is not tame. 3.2. Coarse connectivity of peripherals. We now take a quick detour to introduce some terminology to help us understand the geometric structure of peripherals. In particular, we will look at their ‘coarse components’ [PITH_FULL_IMAGE:figures/full_fig_p009_1.png] view at source ↗

**Figure 2.** Figure 2: The effect of consolidation on the facial rays of a planar graph. Example 3.20. Let Γ be an infinite-ended, 2-connected, locally finite, planar graph, with some fixed embedding ϑ : |Γ| Ñ S 2 of its Freudenthal compactification in the 2-sphere. This embedding exists by [RT02, Lem. 12]. Each complementary components of the image is a topological disk, and its boundary is a simple closed curve [RT02, Prop. … view at source ↗

**Figure 3.** Figure 3: Peripheral system on the 4-regular tree with no tight elliptic cuts. Note that we cannot generally obtain a generating set consisting of tight elements, contrary to the situation for BpΓq. Indeed, it could be the case that BHpΓq contains no tight elements at all. Example 3.28. Let Γ denote the 4-regular tree, viewed as the standard Cayley graph of the free group G “ F2 “ xa, b ; ´y. Consider the peripheral… view at source ↗

**Figure 4.** Figure 4: Illustration of Lemma 3.36. Λptj q “ ΛpHj q. In particular, we have that tj fixes each of the λj,i. Given j P t1, . . . , ku, choose Uj,1 Q λj,1 such that Uj,1 Ă Zj X tjZj . Note that such a Uj,1 exists since Zj is open and λj,1 P Zj X tjZj . In particular, this implies that t ´1 j Uj,1 Ă Zj . We may choose such a Uj,1 since tj fixes ΛpHj q pointwise. Note that with these choices of Uj,1, we have already s… view at source ↗

**Figure 5.** Figure 5: The cycle space of this planar graph is topologically generated by cycles of length 4, but any algebraic generating set must contain arbitrarily long cycles. vanishes, where H8 ˚ denotes locally finite homology; see [Geo08, §11] for a definition. Since Z2 is a field, taking the dual we see that this is equivalent to the natural map H1 c pK; Z2q Ñ H1 pK; Z2q vanishing, where H˚ c denotes compactly support… view at source ↗

**Figure 6.** Figure 6: Illustration of the proof of Proposition 5.6. Note that our statement is in terms of topological G-finite generation, whereas the original statement in [Ham18] only makes reference to algebraic G-finite generation. This upgrade only requires minor modifications to Hamann’s proof, which we discuss in Appendix A. First, we record the following proposition, which allows us to weaken our assumptions on the pe… view at source ↗

read the original abstract

We relativise the Thomassen--Woess definition of accessibility in graphs, defining what it means for a graph to be accessible relative to a peripheral system. In the case of locally finite, quasi-transitive graphs, we characterise relative accessibility in terms of a certain subring of the Boolean ring of the graph, and apply this to show that our definition agrees with the usual algebraic notion of relative accessibility in finitely generated groups. This implies, in particular, that relative accessibility is a quasi-isometry invariant amongst finitely generated groups, when the quasi-isometry coarsely preserves the left cosets of the peripheral subgroups. We also deduce a relative variant of Hamann's accessibility theorem on graphs with finitely generated cycle spaces.

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, simulated authors' rebuttal, and a circularity audit. Tearing a paper down is the easy half of reading it; the pith above is the substance, this is the friction.

Desk Editor's Note private letter to a colleague

The paper provides a Boolean ring characterization of relative graph accessibility that aligns with the group version and yields conditional quasi-isometry invariance.

read the letter

The main takeaway is that MacManus has defined relative accessibility for graphs relative to a peripheral system and characterized it using a subring of the Boolean ring of the graph when the graph is locally finite and quasi-transitive. He then shows this matches the algebraic notion for finitely generated groups, which implies relative accessibility is a quasi-isometry invariant for groups when the map preserves the peripheral cosets coarsely. He also gets a relative version of Hamann's theorem. This is genuinely new in the specific combination of relativization, Boolean ring subring, and the transfer to groups. The paper does well by stating the assumptions clearly and building the argument in a logical order without circularity. The characterization gives an algebraic way to handle the property that could be handy for further work. The soft spots are the scope limitations. Everything is restricted to locally finite quasi-transitive graphs, and the invariance has that extra condition on coset preservation. These are not flaws but they mean the result does not apply as broadly as the title might suggest at first glance. From the abstract the derivations look consistent, though I would want to see the full proofs to confirm no gaps in the ring arguments. This paper is for specialists in geometric group theory and graph theory who care about accessibility and quasi-isometry invariants. Someone working on algebraic invariants of groups or graphs would get direct value from the Boolean ring approach. It deserves serious peer review because it makes a precise connection that builds on prior literature without overclaiming. I would recommend sending it to referees.

Referee Report

0 major / 2 minor

Summary. The manuscript relativizes the Thomassen-Woess definition of accessibility to a peripheral system on graphs. For locally finite quasi-transitive graphs it characterizes relative accessibility via a specific subring of the Boolean ring of the graph; this is applied to prove agreement with the algebraic notion of relative accessibility for finitely generated groups. The agreement yields quasi-isometry invariance of relative accessibility among such groups when the quasi-isometry coarsely preserves left cosets of the peripheral subgroups. A relative version of Hamann's accessibility theorem for graphs with finitely generated cycle spaces is also deduced.

Significance. If the characterization and transfer to groups hold, the work supplies a graph-theoretic foundation for relative accessibility that matches the algebraic definition and confirms quasi-isometry invariance under an explicitly stated hypothesis. This strengthens the interface between accessibility theory for graphs and geometric group theory, while the relative Hamann variant extends an existing theorem in a controlled way.

minor comments (2)

[Main characterization theorem] The statement of the main characterization (presumably Theorem 3.4 or equivalent) should explicitly list the standing assumptions of local finiteness and quasi-transitivity so that the scope is visible at a glance.
[Quasi-isometry invariance result] In the quasi-isometry invariance corollary, restate the coset-preservation hypothesis in the theorem statement itself rather than only in the surrounding text, to avoid any ambiguity about the precise invariance class.

Simulated Author's Rebuttal

0 responses · 0 unresolved

We thank the referee for their positive assessment of the manuscript, including the summary of our relativization of Thomassen-Woess accessibility, the characterization via Boolean rings, the agreement with the algebraic notion for groups, the quasi-isometry invariance result, and the relative Hamann theorem. We appreciate the recommendation for minor revision.

Circularity Check

0 steps flagged

No significant circularity identified

full rationale

The paper defines relative accessibility by relativizing the Thomassen-Woess notion with respect to a peripheral system, then proves a characterization for locally finite quasi-transitive graphs via a specific subring of the Boolean ring of the graph. This characterization is applied to establish agreement with the standard algebraic definition for finitely generated groups. The quasi-isometry invariance is stated only under the explicit additional hypothesis that the quasi-isometry coarsely preserves left cosets of the peripheral subgroups. All steps rest on explicit definitions, standard Boolean-ring operations, and quasi-isometry properties; no load-bearing step reduces by construction to a fitted parameter, self-citation chain, or renamed input. The argument structure (characterization, transfer to groups, conditional invariance) is self-contained against external benchmarks.

Axiom & Free-Parameter Ledger

0 free parameters · 1 axioms · 0 invented entities

The paper introduces a new definition built on existing structures; no free parameters are fitted, no new entities are postulated, and the axioms invoked are standard background results from graph theory and ring theory.

axioms (1)

standard math Standard definitions and properties of locally finite graphs, quasi-transitive actions, Boolean rings of subsets, and quasi-isometries.
The characterization and invariance statements rely on these background facts without additional assumptions introduced in the paper.

pith-pipeline@v0.9.0 · 5397 in / 1221 out tokens · 32187 ms · 2026-05-14T20:32:18.992004+00:00 · methodology

discussion (0)

Lean theorems connected to this paper

Citations machine-checked in the Pith Canon. Every link opens the source theorem in the public Lean library.

IndisputableMonolith/Foundation/AbsoluteFloorClosure.lean reality_from_one_distinction unclear

?

unclear
Relation between the paper passage and the cited Recognition theorem.

Theorem A. Let Γ be a connected, locally finite, quasi-transitive G-graph and H a thin, G-invariant peripheral system. The following are equivalent: (1) Γ is accessible relative to H. (2) BH(Γ) is finitely generated as a G-module.
IndisputableMonolith/Cost/FunctionalEquation.lean washburn_uniqueness_aczel unclear

?

unclear
Relation between the paper passage and the cited Recognition theorem.

We characterise relative accessibility in terms of a certain subring of the Boolean ring of the graph

What do these tags mean?

matches: The paper's claim is directly supported by a theorem in the formal canon.
supports: The theorem supports part of the paper's argument, but the paper may add assumptions or extra steps.
extends: The paper goes beyond the formal theorem; the theorem is a base layer rather than the whole result.
uses: The paper appears to rely on the theorem as machinery.
contradicts: The paper's claim conflicts with a theorem or certificate in the canon.
unclear: Pith found a possible connection, but the passage is too broad, indirect, or ambiguous to say the theorem truly supports the claim.

Reference graph

Works this paper leans on

31 extracted references · 3 canonical work pages · 2 internal anchors

[1]

Planar graphs and covers

Planar graphs and covers , author=. arXiv preprint arXiv:0708.0920 , year=

work page internal anchor Pith review Pith/arXiv arXiv
[2]

Quasi-actions on trees and property (

Manning, Jason Fox , journal=. Quasi-actions on trees and property (. 2006 , publisher=

2006
[3]

The electronic journal of combinatorics , volume=

The structure of locally finite two-connected graphs , author=. The electronic journal of combinatorics , volume=
[4]

International Journal of Algebra and Computation , volume=

A cactus theorem for end cuts , author=. International Journal of Algebra and Computation , volume=. 2014 , publisher=

2014
[5]

2013 , publisher=

Metric spaces of non-positive curvature , author=. 2013 , publisher=

2013
[6]

Combinatorica , volume=

Accessibility in transitive graphs , author=. Combinatorica , volume=. 2018 , publisher=

2018
[7]

Transactions of the American Mathematical Society , volume=

On planar Cayley graphs and Kleinian groups , author=. Transactions of the American Mathematical Society , volume=
[8]

Mathematica Slovaca , volume=

Transitive planar graphs , author=. Mathematica Slovaca , volume=. 1979 , publisher=

1979
[9]

Journal of Combinatorial Theory, Series B , volume=

Vertex-transitive graphs and accessibility , author=. Journal of Combinatorial Theory, Series B , volume=. 1993 , publisher=

1993
[10]

2002 , publisher=

Trees , author=. 2002 , publisher=

2002
[11]

Accessibility, planar graphs, and quasi-isometries

Accessibility, planar graphs, and quasi-isometries , author=. arXiv preprint arXiv:2310.15242 , year=

work page internal anchor Pith review Pith/arXiv arXiv
[12]

Journal of Pure and Applied Algebra , volume=

Pairs of relative cohomological dimension one , author=. Journal of Pure and Applied Algebra , volume=. 1971 , publisher=

1971
[13]

Inventiones mathematicae , volume=

The accessibility of finitely presented groups , author=. Inventiones mathematicae , volume=. 1985 , publisher=

1985
[14]

Journal of Pure and Applied Algebra , volume=

On accessibility of groups , author=. Journal of Pure and Applied Algebra , volume=. 1983 , publisher=

1983
[15]

Geometric group theory , volume=

An inaccessible group , author=. Geometric group theory , volume=. 1993 , publisher=

1993
[16]

2017 , Publisher =

Guirardel, Vincent and Levitt, Gilbert , Title =. 2017 , Publisher =

2017
[17]

1989 , publisher=

Groups acting on graphs , author=. 1989 , publisher=

1989
[18]

Relatively hyperbolic groups: Intrinsic geometry, algebraic properties, and algorithmic problems , volume =

Osin, Denis , year =. Relatively hyperbolic groups: Intrinsic geometry, algebraic properties, and algorithmic problems , volume =. Memoirs of the American Mathematical Society , doi =
[19]

2000 , publisher=

Random walks on infinite graphs and groups , author=. 2000 , publisher=

2000
[20]

Journal of Pure and Applied Algebra , volume=

Remarks on a technique of Dunwoody , author=. Journal of Pure and Applied Algebra , volume=. 1991 , publisher=

1991
[21]

Pacific journal of mathematics , volume=

Groups acting on Cantor sets and the end structure of graphs , author=. Pacific journal of mathematics , volume=. 2002 , publisher=

2002
[22]

2008 , publisher=

Topological methods in group theory , author=. 2008 , publisher=

2008
[23]

Mathematical Proceedings of the Cambridge Philosophical Society , volume=

Ends of graphs , author=. Mathematical Proceedings of the Cambridge Philosophical Society , volume=. 1992 , organization=

1992
[24]

Hamann, Matthias , TITLE =. Abh. Math. Semin. Univ. Hambg. , FJOURNAL =. 2017 , NUMBER =. doi:10.1007/s12188-016-0164-z , URL =

work page doi:10.1007/s12188-016-0164-z 2017
[25]

Proceedings of the London Mathematical Society , volume=

Accessibility and groups of cohomological dimension one , author=. Proceedings of the London Mathematical Society , volume=. 1979 , publisher=

1979
[26]

, TITLE =

Roller, Martin A. , TITLE =. 1993 , TYPE =

1993
[27]

On infinite cycles

Diestel, Reinhard and K. On infinite cycles. Combinatorica , volume=. 2004 , publisher=

2004
[28]

Journal of Combinatorial Theory, Series B , volume=

A Stallings type theorem for quasi-transitive graphs , author=. Journal of Combinatorial Theory, Series B , volume=. 2022 , publisher=

2022
[29]

Journal of Combinatorial Theory, Series B , volume=

Accessibility and ends of graphs , author=. Journal of Combinatorial Theory, Series B , volume=. 1996 , publisher=

1996
[30]

Journal of Combinatorial Theory, Series B , volume=

The structure of quasi-transitive graphs avoiding a minor with applications to the domino problem , author=. Journal of Combinatorial Theory, Series B , volume=. 2024 , publisher=

2024
[31]

Transactions of the American Mathematical Society , volume=

3-connected planar spaces uniquely embed in the sphere , author=. Transactions of the American Mathematical Society , volume=