Search arXivSearch

arXiv · 2203.10831

On a conjecture of spectral extremal problems

Abstract

For a simple graph $F$, let $\mathrm{Ex}(n, F)$ and $\mathrm{Ex_{sp}}(n,F)$ denote the set of graphs with the maximum number of edges and the set of graphs with the maximum spectral radius in an $n$-vertex graph without any copy of the graph $F$, respectively. The Turán graph $T_{n,r}$ is the complete $r$-partite graph on $n$ vertices where its part sizes are as equal as possible. Cioabă, Desai and Tait [The spectral radius of graphs with no odd wheels, European J. Combin., 99 (2022) 103420] posed the following conjecture: Let $F$ be any graph such that the graphs in $\mathrm{Ex}(n,F)$ are Turán graphs plus $O(1)$ edges. Then $\mathrm{Ex_{sp}}(n,F)\subset \mathrm{Ex}(n,F)$ for sufficiently large $n$. In this paper we consider the graph $F$ such that the graphs in $\mathrm{Ex}(n, F)$ are obtained from $T_{n,r}$ by adding $O(1)$ edges, and prove that if $G$ has the maximum spectral radius among all $n$-vertex graphs not containing $F$, then $G$ is a member of $\mathrm{Ex}(n, F)$ for $n$ large enough. Then Cioabă, Desai and Tait's conjecture is completely solved.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Jing Wang, Liying Kang, Yusai Xue. 2022-03-21. On a conjecture of spectral extremal problems. https://arxiv.org/abs/2203.10831

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