11 research outputs found
Stability for large forbidden subgraphs
We extend the classical stability theorem of Erdos and Simonovits for
forbidden graphs of logarithmic order.Comment: Some polishing. Updated reference
Large joints in graphs
We show that if G is a graph of sufficiently large order n containing as many
r-cliques as the r-partite Turan graph of order n; then for some C>0 G has more
than Cn^(r-1) (r+1)-cliques sharing a common edge unless G is isomorphic to the
the r-partite Turan graph of order n. This structural result generalizes a
previous result that has been useful in extremal graph theory.Comment: 9 page
An extension of Tur\'an's Theorem, uniqueness and stability
We determine the maximum number of edges of an -vertex graph with the
property that none of its -cliques intersects a fixed set .
For , the -partite Turan graph turns out to be the unique
extremal graph. For , there is a whole family of extremal graphs,
which we describe explicitly. In addition we provide corresponding stability
results.Comment: 12 pages, 1 figure; outline of the proof added and other referee's
comments incorporate
An extension of Turán's theorem, uniqueness and stability
We determine the maximum number of edges of an n -vertex graph G with the property that none of its r -cliques intersects a fixed set M⊂V(G) . For (r−1)|M|≥n , the (r−1) -partite Turán graph turns out to be the unique extremal graph. For (r−1)|M|<n , there is a whole family of extremal graphs, which we describe explicitly. In addition we provide corresponding stability results
Spectral extremal graphs for edge blow-up of star forests
The edge blow-up of a graph , denoted by , is obtained by
replacing each edge of with a clique of order , where the new vertices
of the cliques are all distinct. Yuan [J. Comb. Theory, Ser. B, 152 (2022)
379-398] determined the range of the Tur\'{a}n numbers for edge blow-up of all
bipartite graphs and the exact Tur\'{a}n numbers for edge blow-up of all
non-bipartite graphs. In this paper we prove that the graphs with the maximum
spectral radius in an -vertex graph without any copy of edge blow-up of star
forests are the extremal graphs for edge blow-up of star forests when is
sufficiently large.Comment: 22. arXiv admin note: text overlap with arXiv:2208.0655
Extremal problems for disjoint graphs
For a simple graph , let and
be the set of graphs with the maximum number of edges and the set of graphs
with the maximum spectral radius in an -vertex graph without any copy of the
graph , respectively. Let be a graph with
. In this paper, we show that
for sufficiently large .
This generalizes a result of Wang, Kang and Xue [J. Comb. Theory, Ser. B,
159(2023) 20-41]. We also determine the extremal graphs of in term of the
extremal graphs of .Comment: 23 pages. arXiv admin note: text overlap with arXiv:2306.1674
Spectral extremal results on edge blow-up of graphs
The edge blow-up of a graph for an integer is
obtained by replacing each edge in with a containing the edge,
where the new vertices of are all distinct. Let and
be the maximum size and maximum spectral radius of an -free
graph of order , respectively. In this paper, we determine the range of
when is bipartite and the exact value of
when is non-bipartite for sufficiently large , which
are the spectral versions of Tur\'{a}n's problems on solved by
Yuan [J. Combin. Theory Ser. B 152 (2022) 379--398]. This generalizes several
previous results on for being a matching, or a star.
Additionally, we also give some other interesting results on for
being a path, a cycle, or a complete graph. To obtain the aforementioned
spectral results, we utilize a combination of the spectral version of the
Stability Lemma and structural analyses. These approaches and tools give a new
exploration of spectral extremal problems on non-bipartite graphs
Spectral extremal problem on copies of -cycle
Denote by the disjoint union of cycles of length . Let
and be the maximum size and spectral radius over all
-vertex -free graphs, respectively. In this paper, we shall pay attention
to the study of both and . On the one hand, we
determine and characterize the extremal graph for any
integers and , where . This
generalizes the result on of Erd\H{o}s [Arch. Math. 13 (1962)
222--227] as well as the research on of F\"{u}redi and
Gunderson [Combin. Probab. Comput. 24 (2015) 641--645]. On the other hand, we
focus on the spectral Tur\'{a}n-type function , and
determine the extremal graph for any fixed and large enough . Our
results not only extend some classic spectral extremal results on triangles,
quadrilaterals and general odd cycles due to Nikiforov, but also develop the
famous spectral even cycle conjecture proposed by Nikiforov (2010) and
confirmed by Cioab\u{a}, Desai and Tait (2022).Comment: 25 pages, one figur