Related papers: The Bandwidth Theorem in Sparse Graphs

We study the following rainbow version of subgraph containment problems in a family of (hyper)graphs, which generalizes the classical subgraph containment problems in a single host graph. For a collection $\textbf{G}=\{G_1, G_2,\ldots,…

We study embeddings of graphs with bounded treewidth or bounded simple treewidth into the undirected graph underlying the directed product of two directed graphs. If the factors have bounded maximum indegrees, then the product graph has…

One of the major results of [N. Robertson and P. D. Seymour. Graph minors. XIII. The disjoint paths problem. J. Combin. Theory Ser. B, 63(1):65--110, 1995], also known as the weak structure theorem, revealed the local structure of graphs…

We show that every $n$-vertex planar graph is contained in the graph obtained from a fan by blowing up each vertex by a complete graph of order $O(\sqrt{n}\log^2 n)$. Equivalently, every $n$-vertex planar graph $G$ has a set $X$ of…

The Erd\H{o}s-S\'{o}s Conjecture states that every graph with average degree more than $k-2$ contains all trees of order $k$ as subgraphs. In this paper, we consider a variation of the above conjecture: studying the maximum size of an…

The Pathwidth Theorem states that if a class of graphs has unbounded pathwidth, then it contains all trees as graph minors. We prove a similar result for dense graphs. More precisely, we give a finite family of tree-like patterns and prove…

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…

Recently there has been much interest in studying random graph analogues of well known classical results in extremal graph theory. Here we follow this trend and investigate the structure of triangle-free subgraphs of $G(n,p)$ with high…

The {\it clique cover width} of $G$, denoted by $ccw(G)$, is the minimum value of the bandwidth of all graphs that are obtained by contracting the cliques in a clique cover of $G$ into a single vertex. For $i=1,2,...,d,$ let $G_i$ be a…

For a graph $G$ and $p\in[0,1]$, we denote by $G_p$ the random sparsification of $G$ obtained by keeping each edge of $G$ independently, with probability $p$. We show that there exists a $C>0$ such that if $p\geq C(\log n)^{1/3}n^{-2/3}$…

Conlon, Gowers, Samotij, and Schacht showed that for a given graph $H$ and a constant $\gamma > 0$, there exists $C > 0$ such that if $p \ge Cn^{-1/m_2(H)}$ then asymptotically almost surely every spanning subgraph $G$ of the random graph…

We prove a conjecture of Bonamy, Bousquet, Pilipczuk, Rz\k{a}\.zewski, Thomass\'e, and Walczak, that for every graph $H$, there is a polynomial $p$ such that for every positive integer $s$, every graph of average degree at least $p(s)$…

Erd\H{o}s conjectured that every $n$-vertex triangle-free graph contains a subset of $\lfloor n/2\rfloor$ vertices that spans at most $n^2/50$ edges. Extending a recent result of Norin and Yepremyan, we confirm this conjecture for graphs…

Let $A$ and $B$ be sets of vertices in a graph $G$. Menger's theorem states that for every positive integer $k$, either there exists a collection of $k$ vertex-disjoint paths between $A$ and $B$, or $A$ can be separated from $B$ by a set of…

We prove that $G_{n,p=c/n}$ whp has a $k$-regular subgraph if $c$ is at least $e^{-\Theta(k)}$ above the threshold for the appearance of a subgraph with minimum degree at least $k$; i.e. an non-empty $k$-core. In particular, this pins down…

For a $k$-uniform hypergraph $H$, let $\delta_1(H)$ denote the minimum vertex degree of $H$, and $\nu(H)$ denote the size of the largest matching in $H$. In this paper, we show that for any $k\geq 3$ and $\beta>0$, there exists an integer…

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$,…

A set of vertices in a graph is a Hamiltonian subset if it induces a subgraph containing a Hamiltonian cycle. Kim, Liu, Sharifzadeh and Staden proved that among all graphs with minimum degree $d$, $K_{d+1}$ minimises the number of…

We prove that, if $m$ is sufficiently large, every graph on $m+1$ vertices that has a universal vertex and minimum degree at least $\lfloor \frac{2m}{3} \rfloor$ contains each tree $T$ with $m$ edges as a subgraph. Our result confirms, for…

The $k$-core of a graph is the largest subgraph of minimum degree at least $k$. We show that for $k$ sufficiently large, the $(k + 2)$-core of a random graph $\G(n,p)$ asymptotically almost surely has a spanning $k$-regular subgraph. Thus…