相关论文: Treewidth of generalized Hamming graph, bipartite …

Cliquewidth is a dense analogue of treewidth. It can be deduced from recent results by Hickingbotham [arXiv:2501.10840] and Nguyen, Scott, and Seymour [arXiv:2501.09839] that graphs of bounded cliquewidth are quasi-isometric to graphs of…

A median graph is a connected graph, such that for any three vertices $u,v,w$ there is exactly one vertex $x$ that lies simultaneously on a shortest $(u,v)$-path, a shortest $(v,w)$-path and a shortest $(w,u)$-path. Examples of median…

The generalized $k$-connectivity of a graph $G$, denoted by $\kappa_k(G)$, is the minimum number of internally edge disjoint $S$-trees for any $S\subseteq V(G)$ with $|S|=k$. The generalized $k$-connectivity is a natural extension of the…

In Graph Minor III, Robertson and Seymour conjecture that the tree-width of a planar graph and that of its dual differ by at most one. We prove that given a hypergraph H on a surface of Euler genus k, the tree-width of H^* is at most the…

Let $H(n, q^2)$ be a non-degenerate Hermitian variety of $PG(n, q^2)$, $n \ge 2$. Let NU$(n+1, q^2)$ be the graph whose vertices are the points of $PG(n, q^2) \setminus H(n, q^2)$ and two vertices $P_1$, $P_2$ are adjacent if the line…

The generalized $k$-connectivity of a graph $G$, denoted by $\kappa_k(G)$, is a generalization of the traditional connectivity. It is well known that the generalized $k$-connectivity is an important indicator for measuring the fault…

We show that all sufficiently large (2k+3)-connected graphs of bounded tree-width are k-linked. Thomassen has conjectured that all sufficiently large (2k+2)-connected graphs are k-linked.

Let $H$ be a graph with vertex set $V(H)=\{v_1, v_2, \cdots, v_k\}$. The generalized blow-up graph $H_{p_1,\ldots,p_k}^{q_1,\ldots,q_k}$ is constructed by replacing each vertex $v_i \in V(H)$ with the graph $G_i = p_iK_t \cup…

Let $\mathcal{G}_{n,r,s}$ denote a uniformly random $r$-regular $s$-uniform hypergraph on the vertex set $\{1,2,\ldots, n\}$. We establish a threshold result for the existence of a spanning tree in $\mathcal{G}_{n,r,s}$, restricting to $n$…

The \textit{toughness} $t(G)$ of a graph $G$ is a measure of its connectivity that is closely related to Hamiltonicity. Brouwer proved the lower bound $t(G) > \ell / \lambda - 2$ on the toughness of any connected $\ell$-regular graph, where…

Let $\mathcal{H}$ be a $k$-uniform hypergraph. A chain in $\mathcal{H}$ is a sequence of its vertices such that every $k$ consecutive vertices form an edge. In 1999 Katona and Kierstead suggested to use chains in hypergraphs as the…

We give an algorithm that takes as input an $n$-vertex graph $G$ and an integer $k$, runs in time $2^{O(k^2)} n^{O(1)}$, and outputs a tree decomposition of $G$ of width at most $k$, if such a decomposition exists. This resolves the…

A {\em theta} is a graph made of three internally vertex-disjoint chordless paths $P_1 = a \dots b$, $P_2 = a \dots b$, $P_3 = a \dots b$ of length at least~2 and such that no edges exist between the paths except the three edges incident to…

For integers $k\geq 1$ and $n\geq 2k+1$, the Kneser graph $K(n,k)$ is the graph whose vertices are the $k$-element subsets of $\{1,\ldots,n\}$ and whose edges connect pairs of subsets that are disjoint. The Kneser graphs of the form…

In the present paper, we investigate the complexity of infinite family of graphs $H_n=H_n(G_1,\,G_2,\ldots,G_m)$ obtained as a circulant foliation over a graph $H$ on $m$ vertices with fibers $G_{1},\,G_{2},\ldots,G_{m}.$ Each fiber…

Unlike minors, the induced subgraph obstructions to bounded treewidth come in a large variety, including, for every $t\geq 1$, the $t$-basic obstructions: the graphs $K_{t+1}$ and $K_{t,t}$, along with the subdivisions of the $t$-by-$t$…

Chung and Graham [J. London Math. Soc. 1983] claimed to prove that there exists an $n$-vertex graph $G$ with $ \frac{5}{2}n \log_2 n + O(n)$ edges that contains every $n$-vertex tree as a subgraph. Frati, Hoffmann and T\'oth [Combin.…

Treewidth and Hadwiger number are two of the most important parameters in structural graph theory. This paper studies graph classes in which large treewidth implies the existence of a large complete graph minor. To formalise this, we say…

The twin-width of a graph measures its distance to co-graphs and generalizes classical width concepts such as tree-width or rank-width. Since its introduction in 2020 (Bonnet et. al. 2020), a mass of new results has appeared relating twin…

In this paper we examine the classes of graphs whose $K_n$-complements are trees and quasi-threshold graphs and derive formulas for their number of spanning trees; for a subgraph $H$ of $K_n$, the $K_n$-complement of $H$ is the graph…