相关论文: Logarithmically-small Minors and Topological Minor…

We study graphs where each edge adjacent to a vertex of small degree (7 and 9, respectively) belongs to many triangles (4 and 5, respectively) and show that these graphs contain a complete graph (K_6 and K_7, respectively) as a minor. The…

Menger's Theorem is a fundamental result in graph theory. It states that if in a graph $G$ with distinguished sets of terminal vertices $S$ and $T$ there are no $k$ pairwise vertex-disjoint $S$-$T$ paths, then there is a set of less than…

The bandwidth theorem [Mathematische Annalen, 343(1):175--205, 2009] states that any $n$-vertex graph $G$ with minimum degree $(\frac{k-1}{k}+o(1))n$ contains all $n$-vertex $k$-colourable graphs $H$ with bounded maximum degree and…

We investigate the question how `small' a graph can be, if it contains all members of a given class of locally finite graphs as subgraphs or induced subgraphs. More precisely, we give necessary and sufficient conditions for the existence of…

A classical result of Robertson and Seymour (1986) states that the treewidth of a graph is linearly tied to its separation number: the smallest integer $k$ such that, for every weighting of the vertices, the graph admits a balanced…

A seminal result of Hajnal and Szemer\'{e}di states that if a graph $G$ with $n$ vertices has minimum degree $\delta(G) \ge (r-1)n/r$ for some integer $r \ge 2$, then $G$ contains a $K_r$-factor, assuming $r$ divides $n$. Extremal examples…

We prove that for any circle graph $H$ with at least one edge and for any positive integer $k$, there exists an integer $t=t(k,H)$ so that every graph $G$ either has a vertex-minor isomorphic to the disjoint union of $k$ copies of $H$, or…

A subgraph-universal graph/a topological minor-universal graph in a class of graphs $\mathcal{G}$ is a graph in $\mathcal{G}$ which contains every graph in $\mathcal{G}$ as a subgraph/topological minor. We prove that the class $\mathcal{P}$…

A cornerstone theorem in the Graph Minors series of Robertson and Seymour is the result that every graph $G$ with no minor isomorphic to a fixed graph $H$ has a certain structure. The structure can then be exploited to deduce far-reaching…

We prove that for every graph $H$, if a graph $G$ has no (odd) $H$ minor, then its vertex set $V(G)$ can be partitioned into three sets $X_1$, $X_2$, $X_3$ such that for each~$i$, the subgraph induced on $X_i$ has no component of size…

For a positive integer r>=2, a K_r-factor of a graph is a collection vertex-disjoint copies of K_r which covers all the vertices of the given graph. The celebrated theorem of Hajnal and Szemer\'edi asserts that every graph on n vertices…

Let $H$ be a $k$-uniform hypergraph on $n$ vertices where $n$ is a sufficiently large integer not divisible by $k$. We prove that if the minimum $(k-1)$-degree of $H$ is at least $\lfloor n/k \rfloor$, then $H$ contains a matching with…

Shrub-depth and rank-depth are related graph parameters that are dense analogs of tree-depth. We prove that for every positive integer $t$, every graph of sufficiently large rank-depth contains a pivot-minor isomorphic to a path on $t$…

The Graph Minor Theorem of Robertson and Seymour asserts that any graph property, whatsoever, is determined by an associated finite list of graphs. We view this as an impressive generalization of Kuratowski's theorem, which characterizes…

We prove blow-up structure theorems for graphs excluding a tree or an apex-tree as a minor. First, we show that for every $t$-vertex tree $T$ with $t\geq 3$ and radius $h$, and every graph $G$ excluding $T$ as a minor, there exists a graph…

Network Coding encourages information coding across a communication network. While the necessity, benefit and complexity of network coding are sensitive to the underlying graph structure of a network, existing theory on network coding often…

Ajtai, Koml\'os, and Szemer\'edi proved that for sufficiently large $t$ every triangle-free graph with $n$ vertices and average degree $t$ has an independent set of size at least $\frac{n}{100t}\log{t}$. We extend this by proving that the…

We prove that for all $\mu>0, t\in (0,1)$ and sufficiently large $n\in 4\mathbb{N}$, if $G$ is an edge-weighted complete graph on $n$ vertices with a weight function $w: E(G)\rightarrow [0,1]$ and the minimum weighted degree…

An identifying code is a subset of vertices of a graph such that each vertex is uniquely determined by its neighbourhood within the identifying code. If $\M(G)$ denotes the minimum size of an identifying code of a graph $G$, it was…

In 1972 Mader proved that every graph with average degree at least $4k$ has a $(k+1)$-connected subgraph with more than $2k$ vertices. We improve this bound by showing that the constant $4$ can be replaced by $3+\frac{1}{3}$; this bound is…