Search arXivSearch

arXiv · 2407.19693

Transversal numbers of simplicial polytopes, spheres, and pure complexes

Abstract

We prove new upper and lower bounds on transversal numbers of several classes of simplicial complexes. Specifically, we establish an upper bound on the transversal numbers of pure simplicial complexes in terms of the number of vertices and the number of facets, and then provide constructions of pure simplicial complexes whose transversal numbers come close to this bound. We introduce a new family of $d$-dimensional polytopes that could be considered as ``siblings'' of cyclic polytopes and show that the transversal ratios of such odd-dimensional polytopes are $2/5-o(1)$. The previous record for the transversal ratios of $(2k+1)$-polytopes was $1/(k+1)$. Finally, we construct infinite families of $3$-, $4$-, and $5$-dimensional simplicial spheres with transversal ratios converging to $4/7$, $1/2$, and $6/11$, respectively. The previous record was $11/21$, $2/5$, and $1/2$, respectively.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Isabella Novik, Hailun Zheng. 2025-10-07. Transversal numbers of simplicial polytopes, spheres, and pure complexes. https://arxiv.org/abs/2407.19693

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