Universality in Rayless Graphs

• The paper establishes that the strong complexity of rayless graphs of size ≤κ is exactly κ⁺ using a transfinite inductive construction.
• The paper leverages a rank function and immersion theory to analyze subclasses, showing countable bounds when star-subdivisions are forbidden.
• The paper demonstrates that, under extreme structural restrictions, forbidden configurations can collapse complexity or even reach continuum levels.

A rayless graph is an infinite graph lacking any one-way infinite path (ray), a notion central to the study of graph structures and their universality properties. The theory of universality in rayless graphs explores the existence, minimal size, and structure of universal and strongly universal families within various classes of rayless graphs, considering both unrestricted and subgraph-forbidden cases. The main focus is to characterize the minimal cardinality required for a family of rayless graphs such that every member of a given class strongly immerses into some member of the family, with results sensitive to cardinality, forbidden substructures, and natural subclass decompositions (Aurichi et al., 17 Dec 2025).

1. Fundamental Notions: Rayless Graphs, Rank, and Immersions

A graph is rayless if it contains no ray, i.e., no subgraph isomorphic to a one-way infinite path. The class of all rayless graphs with cardinality at most $\kappa$ is denoted $\mathbf{A}_\kappa$. Schmidt (1982) introduced a rank function for connected rayless graphs, assigning to each graph $G$ an ordinal $\mathrm{rk}(G)$, recursively defined as the smallest $\alpha$ such that there exists a finite set $F\subseteq G$ with all components of $G-F$ having rank $<\alpha$. The class $\mathbf{A}_\kappa^\alpha$ comprises rayless graphs of rank $<\alpha$.

An immersion $\phi: G \to H$ is a vertex-injective graph morphism; it is strong if $\phi$ is an isomorphism onto the induced subgraph $H[\mathrm{im}\,\phi]$. A family $\mathcal{F} \subseteq \mathcal{C}$ is universal for a class $\mathcal{C}$ if every $G\in \mathcal{C}$ immerses into some $H\in\mathcal{F}$, and strongly universal if the immersion is strong. The (strong) complexity of $\mathcal{C}$, denoted $\mathrm{Cpx}(\mathcal{C})$ and $\mathrm{Stc}(\mathcal{C})$, is the minimal cardinality of (strongly) universal families.

2. Universality and Strong Complexity in Rayless Graphs

The central theorem asserts that for any infinite cardinal $\kappa$, the class $\mathbf{A}_\kappa$ of rayless graphs of size at most $\kappa$ satisfies

$\mathrm{Stc}(\mathbf{A}_\kappa) = \kappa^+,$

where $\kappa^+$ is the successor cardinal of $\kappa$. No smaller strongly universal family exists, and this also establishes the exact strong complexity for countable rayless graphs, resolving a problem left open by Diestel, Halin, and Vogler.

For rank-restricted subclasses $\mathbf{A}_\kappa^\alpha$:

$$\mathrm{Stc}(\mathbf{A}_\kappa^\alpha) = \begin{cases} \aleph_0,&\alpha \text{ successor},\ \mathrm{cf}(\alpha),&\alpha \text{ limit}, \end{cases}$$

where $\aleph_0$ is the countable cardinal, and $\mathrm{cf}(\alpha)$ is the cofinality of $\alpha$.

The proof proceeds by transfinite induction on rank, constructing at each stage a family of strongly universal graphs by gluing $\kappa$-many disjoint copies of graphs of smaller rank onto finite “kernel” graphs and ensuring coverage of all possible kernel-attachment configurations.

3. Impact of Forbidding Finite and Infinite Subgraphs

Upon excluding a finite set $\mathcal{K}$ of finite graphs as forbidden immersed subgraphs, the complexity becomes

$$\mathrm{Stc}(\mathbf{A}_\kappa(\mathcal{K})) = \begin{cases} \kappa^+,&\text{if no } K\in\mathcal{K} \text{ is a star-subdivision},\ \aleph_0,&\text{if some } K\in\mathcal{K} \text{ is a star-subdivision}. \end{cases}$$

That is, forbidding a star-subdivision collapses the rank hierarchy in the class, yielding a countable (strongly) universal family, while in all non-degenerate cases the minimal complexity persists as $\kappa^+$. The inductive construction adapts by avoiding the attachment of pieces that could introduce any forbidden subgraph.

Contrastingly, for certain infinite forbidden subgraphs, complexity can reach the continuum. For instance, if $K$ is the “bouquet” of countably many disjoint cycles of all lengths joined at a central vertex, then

$$\mathrm{Cpx}(\mathbf{A}_{\aleph_0}(K)) = 2^{\aleph_0} = \mathfrak{c},$$

where $\mathfrak{c}$ is the cardinality of the continuum. In this case, there are $2^{\aleph_0}$ non-immersible classes, demonstrating maximal complexity in the countable case.

4. Universality for Classes Forbidding Infinite Bouquets

Given a finite connected graph $K$ and separating set $N\subseteq V(K)$ such that $K-N$ remains connected, the infinite bouquet $B(K,N)$ is formed by amalgamating countably many copies of $K$ along $N$. For any infinite cardinal $\kappa$, and provided $B(K,N)$ is not itself a star subdivision, the class of rayless graphs of size $\leq\kappa$ forbidding $B(K,N)$ as an immersion again yields

$$\mathrm{Stc}(\mathbf{A}_\kappa(B(K,N))) = \kappa^+.$$

The inductive construction is adjusted to circumvent immersions of $B(K,N)$, but the overall cardinality bound is retained.

5. Stability Under Natural Subclass Restrictions

Natural hereditary subclasses of rayless graphs also preserve the minimal strong complexity. This includes:

• Rayless trees (all cycles forbidden): $$\mathrm{Stc}(\mathbf{A}_\kappa(\text{trees})) = \kappa^+$$
• Rayless bipartite graphs (odd cycles forbidden): $$\mathrm{Stc}(\mathbf{A}_\kappa(\text{bipartite})) = \kappa^+$$
• Rayless graphs without even cycles: $$\mathrm{Stc}(\mathbf{A}_\kappa(\text{no even cycles})) = \kappa^+$$
• Rayless graphs without infinite trails (a weaker notion than rays): $\mathrm{Stc}(\mathbf{B}_\kappa) = \kappa^+$

These results emphasize that the structure of rank and inductive construction is robust under many common graph-theoretic subclass conditions.

6. Summary Table: Strong Complexity in Key Cases

Class Description	Cardinality Bound	Strong Complexity
All rayless graphs	$\le \kappa$	$\kappa^+$
Rayless graphs, forbidding star-subdivision	$\le \kappa$	$\aleph_0$
Rayless graphs, finite $\mathcal{K}$ forbidden, not star	$\le \kappa$	$\kappa^+$
Rayless graphs, single infinite bouquet $K$	countable ($\aleph_0$)	$2^{\aleph_0}$ (continuum)
Rayless trees/bipartite/no even cycles	$\le \kappa$	$\kappa^+$
Rayless graphs w/o infinite trails	$\le \kappa$	$\kappa^+$

In each non-degenerate case—that is, as long as the forbidden subgraphs do not truncate the hierarchy of rayless graphs to yield only finitely many ranks—the minimal strong complexity $\kappa^+$ is preserved. Only in cases of extreme structural restriction (notably, forbidding a star-subdivision) does the strong complexity collapse to countable (Aurichi et al., 17 Dec 2025).