Paperlane

no. 14 · Friday 13 November 2026

Contraction Containment in Labeled Trees: Support Counts, Collision Cores, and Star Avoidance

Levi Segal

math.CO · v4 · 30 pp

Abstract

We study whether a labeled tree can be recovered from the numbers of larger labeled trees that contract to it. We first characterize containment using the edge splits induced on a proposed survivor set and derive an exact formula for hosts with one marked display. We then study several displays in the same host. After contracting every edge invisible to all \(k\) displays of an \(n\)-vertex target, the remaining collision core has at most \(k(n-1)+1\) vertices. Once the coincidences and relative positions of the surviving labels are recorded, these bounded cores give a finite exact expansion of each collision count. We also prove that almost every sufficiently large labeled tree contains any fixed target, with an exponentially small exceptional proportion. We obtain an exact avoidance formula and generating function for star displays in which the center survivor is the largest label of the host. We call such displays top-centered. We derive fixed-star asymptotics and a coarse threshold for this restricted containment problem.

comments
30 pages, 4 figures, additions to mathematical content and updates to exposition, accepted for publication in Ars Combinatorica
fields
Combinatorics
pdf ↗ page arXiv:2606.07668 ↗