Search arXivSearch

arXiv · 2607.23618

Hall's universal group does not have finite big Ramsey degrees

Abstract

In this paper we show that the Hall's universal group does not have finite big Ramsey degrees. Our strategy consists of piggybacking on the recent result of Hubička, Konečný, Todorčević and Zucker (announced at EUROCOMB 2025) that the random edge-labelled graph (the Fraïssé limit of the class of all finite complete edge-labelled graphs where the set of labels is countably infinite) does not have finite big Ramsey degrees. We then use the machinery of category theory to transport this result from the context of edge-labelled graphs to the context of groups. The main step in the process is the construction of a functor from the category of edge-labelled graphs and embeddings to the category of groups and group embeddings which takes finite graphs to finite groups. This makes is possible for us to build a subgroup of the Hall's universal group which encodes the random edge-labelled graph.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Dragan Mašulović, Veljko Toljić. 2026-08-17. Hall's universal group does not have finite big Ramsey degrees. https://arxiv.org/abs/2607.23618

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Rooted Spider Embeddings and the Erd\H os-Sós Conjecture

Under a local density condition, we prove that every $k$-edge spider embeds at any prescribed center of degree at least $k$, unless all legs are even and the host graph has one of two specified structures. These structures contain complete bipartite subgraphs with prescribed neighborhoods. The proof uses path rerouting and three exchange lemmas that describe equality in neighborhood estimates. As a consequence, we recover the Erd\H os-Sós bound for all spiders.

math.CO

Generalized Goulden-Yong duals and signed minimal factorizations

In this paper, we give two combinatorial ways to study signed exceptional sequences. First, we show the equivalence between one-way reflections and relatively projective representations. Secondly, we construct generalized Goulden-Yong duals using reverse Garside element actions and folded chord diagrams. We then give two applications of the generalized Goulden-Yong duals: constructing generalized Prüfer codes and counting signed factorizations using the matrix-tree theorem.

math.CO

Explicit expressions for iterates of power series

We present several formulas for both the discrete and fractional iterates of an invertible power series $f$, using a new unifying approach based on umbral calculus. Known formulas are extended, and their proofs simplified, while new expressions are introduced. In particular, by employing $q$-calculus identities, we eliminate the requirement for $f'(0)$ to equal $1$ and the resulting general expressions for the iterative logarithm are obtained as well.

math.CO