Search arXivSearch

arXiv · 1410.7676

The densest matroids in minor-closed classes with exponential growth rate

Abstract

The $\mathit{growth\ rate\ function}$ for a nonempty minor-closed class of matroids $\mathcal{M}$ is the function $h_{\mathcal{M}}(n)$ whose value at an integer $n \ge 0$ is defined to be the maximum number of elements in a simple matroid in $\mathcal{M}$ of rank at most $n$. Geelen, Kabell, Kung and Whittle showed that, whenever $h_{\mathcal{M}}(2)$ is finite, the function $h_{\mathcal{M}}$ grows linearly, quadratically or exponentially in $n$ (with base equal to a prime power $q$), up to a constant factor. We prove that in the exponential case, there are nonnegative integers $k$ and $d \le \tfrac{q^{2k}-1}{q-1}$ such that $h_{\mathcal{M}}(n) = \frac{q^{n+k}-1}{q-1} - qd$ for all sufficiently large $n$, and we characterise which matroids attain the growth rate function for large $n$. We also show that if $\mathcal{M}$ is specified in a certain `natural' way (by intersections of classes of matroids representable over different finite fields and/or by excluding a finite set of minors), then the constants $k$ and $d$, as well as the point that `sufficiently large' begins to apply to $n$, can be determined by a finite computation.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Jim Geelen, Peter Nelson. 2014-10-28. The densest matroids in minor-closed classes with exponential growth rate. https://arxiv.org/abs/1410.7676

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