Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 2211.07822

Stability of generalized Turán number for linear forests

Yisai Xue·Yichong Liu·Liying Kang
View original source ↗Read source document ↗Export metadata ↓

Abstract

Given a graph $T$ and a family of graphs $\mathcal{F}$, the generalized Turán number of $\mathcal{F}$ is the maximum number of copies of $T$ in an $\mathcal{F}$-free graph on $n$ vertices, denoted by $ex(n,T,\mathcal{F})$. When $T = K_r$, $ex(n, K_r, \mathcal{F})$ is a function specifying the maximum possible number of $r$-cliques in an $\mathcal{F}$-free graph on $n$ vertices. A linear forest is a forest whose connected components are all paths and isolated vertices. Let $\mathcal{L}_{k}$ be the family of all linear forests of size $k$ without isolated vertices. In this paper, we obtained the maximum possible number of $r$-cliques in $G$, where $G$ is $\mathcal{L}_{k}$-free with minimum degree at least $d$. Furthermore, we give a stability version of the result. As an application of the stability version of the result, we obtain a clique version of the stability of the Erdős-Gallai Theorem on matchings.

Explore related subjects

math.CO

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Yisai Xue, Yichong Liu, Liying Kang. 2022-11-15. Stability of generalized Turán number for linear forests. https://arxiv.org/abs/2211.07822

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

KEEP EXPLORING

Related papers

arXiv2026

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↗
arXiv2026

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↗