Search arXivSearch

arXiv · 1705.04937

Locally finite trees and the topological minor relation

Abstract

A well-known theorem of Nash-Williams shows that the collection of locally finite trees under the topological minor relation results in a BQO. Set theoretically, two very natural questions arise: (1) What is the number $λ$ of topological types of locally finite trees? (2) What are the possible sizes of an equivalence class of locally finite trees? For (1), clearly, $ω\leq λ\leq \mathfrak{c}$ and Matthiesen refined it to $ω_1 \leq λ\leq \mathfrak{c}$. Thus, this question becomes non-trivial when the Continuum Hypothesis is not assumed. In this paper we address both questions by showing that - entirely within ZFC - for a large collection of locally finite trees that includes those with countably many rays: the answer for (1) is $λ= ω_1$, and that for (2) the size of an equivalence class can only be either $1$ or $\mathfrak{c}$.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Jorge Bruno, Paul J. Szeptycki. 2017-05-14. Locally finite trees and the topological minor relation. https://arxiv.org/abs/1705.04937

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

KEEP EXPLORING

Related papers

Adjunctions, Box Products, and Forcing Families

Sidorenko's conjecture states that the number of copies of any given bipartite graph in another graph of given density is asymptotically minimized by a random graph. For bipartite graphs containing a cycle, the forcing conjecture further asserts that asymptotic equality characterizes quasi-random graphs. We establish an adjoint identity for a general class of graph-substitution operators and use it to obtain Sidorenko and forcing results for balanced blow-ups, subdivisions, Cartesian products, and strong products.

math.CO

On the Cost Number of Graphs with Determining Number Two

A distinguishing vertex coloring of a graph $G$ is a vertex coloring such that only the identity automorphism of $G$ preserves the coloring. A graph is $2$-distinguishable if it admits a distinguishing vertex coloring with two colors, and its cost $ρ(G)$ is the minimum size of a color class in such a coloring. The determining number of a graph $G$, denoted by $Det(G)$, is the minimum size of a subset $S\subseteq V(G)$ such that only the trivial automorphism fixes every element of $S$ pointwise. Boutin (J. Combin. Math. Combin. Comput. 85: 161-171, 2013) asked if $ρ(G)$ and $Det(G)$ can be arbitrarily far apart. While the case for $Det(G) = 1$ is trivial, the answer remained unknown for $Det(G) \ge 2$. In this manuscript, we show that if $Det(G)=2$ then not only is $ρ(G)$ bounded, but in fact $ρ(G) \leq 4$. This is the first resolution of Boutin's question for any nontrivial fixed determining number. Moreover, for every fixed $Det(G)= n$, we construct examples giving a lower bound on any possible upper bound for $ρ(G)$ in terms of $n$.

math.CO