相关论文: Spectral extremal problems on outerplanar and plan…

A connected graph is called a block graph if each of its blocks is a complete graph. Let $\mathbf{Bl}(\textbf{k}, \varphi)$ be the class of block graphs on $\textbf{k}$ vertices with given dissociation number $\varphi$. In this article, we…

A graph $G$ is a non-separating planar graph if there is a drawing $D$ of $G$ on the plane such that (1) no two edges cross each other in $D$ and (2) for any cycle $C$ in $D$, any two vertices not in $C$ are on the same side of $C$ in $D$.…

Let $\mathcal{G}_{n, \beta^*}$ $(\mathcal{G}^*_{n,\beta^*})$ be the set of all (connected) graphs of order $n$ with fractional matching number $\beta^*$. In this paper, the graphs with maximal spectral radius in $\mathcal{G}_{n,\beta^*}$…

We systematically study a natural problem in extremal graph theory, to minimize the number of edges in a graph with a fixed number of vertices, subject to a certain local condition: each vertex must be in a copy of a fixed graph $H$. We…

For positive integers $n>k>t$ let $\binom{[n]}{k}$ denote the collection of all $k$-subsets of the standard $n$-element set $[n]=\{1,\ldots,n\}$. Subsets of $\binom{[n]}{k}$ are called $k$-graphs. A $k$-graph $\mathcal{F}$ is called…

Given an $r$-graph $F$ with $r \ge 2$, let $\mathrm{ex}(n, (t+1) F)$ denote the maximum number of edges in an $n$-vertex $r$-graph with at most $t$ pairwise vertex-disjoint copies of $F$. Extending several old results and complementing…

For a graph $H$, the {\em extremal number} $ex(n,H)$ is the maximum number of edges in a graph of order $n$ not containing a subgraph isomorphic to $H$. Let $\delta(H)>0$ and $\Delta(H)$ denote the minimum degree and maximum degree of $H$,…

The planar Tu\'{a}n number of $H$, denoted by $ex_{\mathcal{P}}(n,H)$, is defined as the maximum number of edges in an $n$-vertex $H$-free planar graph. The exact value of $ex_{\mathcal{P}}(n,H)$ remains a mystery when $H$ is large (for…

This paper presents a sharp upper bound for the spectral radius of simple digraphs with described number of arcs. Further, the extremal graphs which attain the maximum spectral radius among all simple digraphs with fixed arcs are…

Recently, Ali et al. posed several open problems concerning extremal graphs with respect to the ABS index. These problems involve characterizing graphs that attain the maximum ABS index within specific graph classes, including: connected…

A graph is color-critical if it contains an edge whose deletion reduces its chromatic number. This class of graphs, including cliques and odd cycles, plays a central role in extremal graph theory. In this paper, following an influential…

Given a graph $H$ and a natural number $n$, the extremal number $\mathrm{ex}(n, H)$ is the largest number of edges in an $n$-vertex graph containing no copy of $H$. In this paper, we obtain a general upper bound for the extremal number of…

We give an upper bound on the maximal eigenvalue of the adjacency matrix of a connected graph in terms of its maximum degree, diameter and order. This bound is best possible up to a constant factor and improves prevoius results of…

For every integer $k \ge 3$, we determine the extremal structure of an $n$-vertex graph with at most $t$ vertex-disjoint copies of $C_{2k}$ when $n$ is sufficiently large and $t$ lies in the interval…

A graph is called $K$-almost regular if its maximum degree is at most $K$ times the minimum degree. Erd\H{o}s and Simonovits showed that for a constant $0< \varepsilon< 1$ and a sufficiently large integer $n$, any $n$-vertex graph with more…

This survey is two-fold. We first report new progress on the spectral extremal results on the Tur\'{a}n type problems in graph theory. More precisely, we shall summarize the spectral Tur\'{a}n function in terms of the adjacency spectral…

Erd\H{o}s proved an upper bound on the number of edges in an $n$-vertex non-Hamiltonian graph with given minimum degree and showed sharpness via two members of a particular graph family. F\"{u}redi, Kostochka and Luo showed that these two…

The classic extremal problem is that of computing the maximum number of edges in an $F$-free graph. In the case where $F=K_{r+1}$, the extremal number was determined by Tur\'an. Later results, known as supersaturation theorems, proved that…

Given a graph family $\mathcal{H}$ with $\min_{H\in \mathcal{H}}\chi(H)=r+1\geq 3$. Let ${\rm ex}(n,\mathcal{H})$ and ${\rm spex}(n,\mathcal{H})$ be the maximum number of edges and the maximum spectral radius of the adjacency matrix over…

A dissociation set in a graph is a subset of vertices which induces a subgraph with maximum degree at most one. The dissociation number of a graph is the maximum cardinality of its dissociation sets. In this paper, we consider the…