arxiv: 2604.17164 · v1 · submitted 2026-04-18 · 🧮 math.GN · math.CO

Recognition: unknown

A topological characterization of end space of infinite graphs via games, subspaces and products

Leandro Aurichi , Gustavo Boska , Davide Giacopello , Paulo Magalh\~aes J\'unior

Authors on Pith no claims yet

Pith reviewed 2026-05-10 06:28 UTC · model grok-4.3

classification 🧮 math.GN math.CO

keywords end spacesinfinite graphstopological gamesspecial subbasesBaire propertyG-delta setsproduct spaces

0 comments

The pith

End spaces of infinite graphs are exactly the topological spaces that have a special subbase for which one player wins a certain game.

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

This paper gives a characterization of which spaces can be the end space of an infinite graph. The test uses a particular subbase for the topology together with the existence of a winning strategy in a topological game played on that space. If correct, the result lets us conclude that end spaces must be hereditarily Baire, that Gδ subspaces remain end spaces, and that taking products can take us outside the class. A reader would care because it supplies a concrete criterion for recognizing these spaces and shows what operations preserve or destroy the property.

Core claim

A topological space is the end space of some infinite graph if and only if it admits a special subbase such that in the topological game associated to this subbase, one of the two players has a winning strategy. This is offered as an alternative to the 2023 characterization by Pitz that relied on hereditarily complete special subbases.

What carries the argument

The pair consisting of a special subbase and the topological game defined from it, which together serve as the criterion for being an end space.

Load-bearing premise

That the proposed combination of a special subbase and a topological game is necessary and sufficient to recognize end spaces of graphs, with no hidden restrictions applying to the graphs or spaces under consideration.

What would settle it

Observe a space that possesses such a special subbase and winning strategy yet is not homeomorphic to the end space of any graph, or find an end space of a graph that fails to have any such subbase and game.

read the original abstract

In 1992, Diestel asked which topological spaces could be represented as the end space of some graph. In 2023, Pitz provided a solution to this question by giving a topological characterization of end spaces using a hereditarily complete special subbase. In this paper, we present an alternative topological characterization of end spaces, in which we employ a special subbase and a topological game. Furthermore, we provide several applications of this characterization: we show that every end space is hereditarily Baire, that $G_{\delta}$ subspaces of end spaces are also end spaces, and that the product of end spaces is not always an end space.

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

This paper gives a workable alternative to Pitz's characterization of end spaces by adding a topological game to the subbase, and it extracts three clean applications from the result.

read the letter

The main takeaway is that this paper gives an alternative characterization of end spaces of infinite graphs by combining a special subbase with a topological game. From this they derive three properties: end spaces are hereditarily Baire, Gδ subspaces of end spaces are themselves end spaces, and the product of two end spaces is not necessarily an end space. They do a good job proving both necessity and sufficiency. Any end space satisfies the subbase and game rules, and conversely any space obeying those rules arises as the end space of some graph. The constructions do not impose hidden conditions like bounded degree or countability, which makes the result broad. The three applications follow directly once the characterization is in place. They appear new compared to Pitz's earlier solution using a hereditarily complete subbase. The proofs seem careful and avoid circularity. One minor point is that the topological game adds a layer of definition that might take time to absorb, but it does not create any evident problems in the arguments. The overall logic holds up. The paper positions itself clearly as building on the 1992 question and the 2023 answer, without claiming to replace it entirely but offering a different tool that yields the applications. This work is for researchers focused on infinite graph topology or on finding topological invariants for graph ends. A reader who knows the Diestel-Pitz context will see the value in the new applications and the alternative view. It has the grounding and the concrete results to justify sending it to peer review. I would recommend accepting it for review rather than desk rejecting it.

Referee Report

0 major / 2 minor

Summary. The manuscript presents an alternative topological characterization of end spaces of infinite graphs: a space is an end space if and only if it admits a special subbase such that a certain topological game on the space has a winning strategy for one of the players. Necessity is shown by verifying that end spaces of arbitrary infinite graphs satisfy the subbase and game conditions; sufficiency is shown by constructing, for any space meeting the conditions, a graph whose end space recovers it. Three applications are derived directly from the characterization: every end space is hereditarily Baire, every Gδ subspace of an end space is itself an end space, and the product of end spaces is not necessarily an end space.

Significance. The result supplies a useful alternative to Pitz's 2023 characterization (which relied on a hereditarily complete special subbase) by replacing the completeness condition with a game-theoretic one. The explicit necessity and sufficiency arguments, together with the absence of hidden restrictions on graph degree or countability in the constructions, make the characterization a potentially flexible tool for further work on infinite graphs and their ends. The three applications follow immediately from the characterization without additional hypotheses and address natural questions about closure properties of the class of end spaces.

minor comments (2)

[Introduction] The introduction could briefly recall the precise definition of the special subbase used by Pitz so that readers can immediately see how the game condition replaces the hereditary-completeness requirement.
[Section 3] In the sufficiency construction, the notation for the auxiliary vertices and edges added to realize the game-winning strategy could be introduced with a small diagram or explicit indexing to improve readability.

Simulated Author's Rebuttal

0 responses · 0 unresolved

We thank the referee for their positive assessment of the manuscript and for recommending acceptance. We are pleased that the alternative characterization via special subbases and topological games, along with the three applications, was viewed as a flexible and useful contribution relative to existing work.

Circularity Check

0 steps flagged

No significant circularity; characterization via independent necessity and sufficiency

full rationale

The paper's central result is a standard if-and-only-if characterization: necessity proves that end spaces of arbitrary infinite graphs satisfy the stated special subbase plus topological game conditions, while sufficiency explicitly constructs a graph whose end space matches any space obeying those conditions. No equations, definitions, or arguments reduce the claimed properties to fitted parameters, self-referential inputs, or load-bearing self-citations. The work cites Diestel and Pitz for context but supplies self-contained proofs without importing uniqueness theorems or ansatzes from prior author work. This is the expected non-circular outcome for a direct topological characterization theorem.

Axiom & Free-Parameter Ledger

0 free parameters · 1 axioms · 0 invented entities

The characterization rests on the standard axioms of general topology and the combinatorial definition of graph ends; no free parameters, ad-hoc axioms, or new entities are mentioned in the abstract.

axioms (1)

standard math Standard axioms of general topology together with the definition of ends of infinite graphs
The entire development presupposes the usual topological and graph-theoretic foundations.

pith-pipeline@v0.9.0 · 5418 in / 1225 out tokens · 36428 ms · 2026-05-10T06:28:24.520582+00:00 · methodology

discussion (0)

Reference graph

Works this paper leans on

23 extracted references · 2 canonical work pages

[1]

Aurichi and R

L. Aurichi and R. Dias. A minicourse on topological games.Topology and its Applica- tions, 258:305–335, 2019

2019
[2]

Barnsley

M. Barnsley. Chapter iv - chaotic dynamics on fractals. InFractals Everywhere (Second Edition), pages 115–170. Academic Press, second edition edition, 1993

1993
[3]

Bondarenko, D

I. Bondarenko, D. D’Angeli, and T. Nagnibeda. Ends of Schreier graphs and cut-points of limit spaces of self-similar groups.J. Fractal Geom., 4(4):369–424, 2017

2017
[4]

W. Brian. Completely ultrametrizable spaces and continuous bijections.Topol. Proc., 45:233–252, 2015

2015
[5]

Bruhn, R

H. Bruhn, R. Diestel, and M. Stein. Cycle-cocycle partitions and faithful cycle covers for locally finite graphs.J. Graph Theory, 50(2):150–161, 2005

2005
[6]

P. Cohen. Products of Baire spaces.Proc. Am. Math. Soc., 55:119–124, 1976

1976
[7]

Conner and W

G. Conner and W. Hojka. Ends of iterated function systems.Math. Z., 277(3-4):1073– 1083, 2014

2014
[8]

R. Diestel. The end structure of a graph: Recent results and open problems.Discrete Math., 100(1-3):313–327, 1992

1992
[9]

R. Diestel. Locally finite graphs with ends: A topological approach. I: Basic theory. Discrete Math., 311(15):1423–1447, 2011

2011
[10]

Engelking.General Topology

R. Engelking.General Topology. Sigma series in pure mathematics. Heldermann, 1989

1989
[11]

Freudenthal

H. Freudenthal. Neuaufbau der Endentheorie.Ann. Math. (2), 43:261–279, 1942

1942
[12]

R. Halin. Über unendliche Wege in Graphen.Math. Ann., 157:125–137, 1964

1964
[13]

H. Hopf. Enden offener Räume und unendliche diskontinuierliche Gruppen.Comment. Math. Helv., 16:81–100, 1944

1944
[14]

Kechris.Classical Descriptive Set Theory

A. Kechris.Classical Descriptive Set Theory. Graduate Texts in Mathematics. Springer New York, 2012

2012
[15]

Kurkofka, R

J. Kurkofka, R. Melcher, and M. Pitz. Approximating infinite graphs by normal trees. J. Combin. Theory Ser. B, 148:173–183, 2021

2021
[16]

Kurkofka and M

J. Kurkofka and M. Pitz. A representation theorem for end spaces of infinite graphs. arXiv:2111.12670, 2023

work page arXiv 2023
[17]

A. Lemin. On ultrametrization of general metric spaces.Proceedings of the American Mathematical Society, 131, 03 2003

2003
[18]

P. Nyikos. On some non-archimedean spaces of alexandroff and urysohn.Topology and its Applications, 91(1):1–23, 1999. in Memory of P.S. Alexandroff, Part 2

1999
[19]

J. Oxtoby. The banach-mazur game and banach category theorem.Contributions to the Theory of Games, 3:159–163, 1957

1957
[20]

J. Oxtoby. Cartesian products of baire spaces.Fundam. Math., 49:157–166, 1961

1961
[21]

M. Pitz. Characterising path-, ray- and branch spaces of order trees, and end spaces of infinite graphs. arXiv:2303.00547, 2023

work page arXiv 2023
[22]

Stallings

J. Stallings. On torsion-free groups with infinitely many ends.Ann. Math. (2), 88:312– 334, 1968

1968
[23]

A. Stone. Paracompactness and product spaces.Bulletin of the American Mathematical Society, 54:977–982, 1948. 21 L. Aurichi,Instituto de Ciências Matemáticas e de Computação, Universidade de São Paulo A venida Trabalhador são-carlense, 400, São Carlos, SP, 13566-590, Brazil E-mail address, L. Aurichi:aurichi@icmc.usp.br G. Boska,Instituto de Ciências Mate...

1948