Related papers: Robustness of the Sauer-Spencer Theorem

The Bandwidth theorem of B\"ottcher, Schacht and Taraz gives a condition on the minimum degree of an $n$-vertex graph $G$ that ensures $G$ contains every $r$-chromatic graph $H$ on $n$ vertices of bounded degree and of bandwidth $o(n)$,…

Let $H$ be a graph on $h$ vertices. The number of induced copies of $H$ in a graph $G$ is denoted by $i_H(G)$. Let $i_H(n)$ denote the maximum of $i_H(G)$ taken over all graphs $G$ with $n$ vertices. Let $f(n,h) = \Pi_{i}^h a_i$ where…

We provide a degree condition on a regular $n$-vertex graph $G$ which ensures the existence of a near optimal packing of any family $\mathcal H$ of bounded degree $n$-vertex $k$-chromatic separable graphs into $G$. In general, this degree…

For a family of graphs $\mathcal{F}$, a graph $G$ is $\mathcal{F}$-universal if $G$ contains every graph in $\mathcal{F}$ as a (not necessarily induced) subgraph. For the family of all graphs on $n$ vertices and of maximum degree at most…

Given an increasing graph property $\mathcal{P}$, a graph $G$ is $\alpha$-resilient with respect to $\mathcal{P}$ if, for every spanning subgraph $H\subseteq G$ where each vertex keeps more than a $(1-\alpha)$-proportion of its neighbours,…

Denote by $r_g(G,\mathcal{H})$ the global resilience of a graph $G$ with respect to Hamiltonicity. That is, $r_g(G,\mathcal{H})$ is the minimal $r$ for which there exists a subgraph $H\subseteq G$ with $r$ edges, such that $G\setminus H$ is…

Let $\bk=(k_1,...,k_n)$ be a sequence of $n$ integers. For an increasing monotone graph property $\mP$ we say that a base graph $G=([n],E)$ is \emph{$\bk$-resilient} with respect to $\mP$ if for every subgraph $H\subseteq G$ such that…

We derive a sufficient condition for a sparse graph G on n vertices to contain a copy of a tree T of maximum degree at most d on (1-\epsilon)n vertices, in terms of the expansion properties of G. As a result we show that for fixed d\geq 2…

We show that for any constant $\Delta \ge 2$, there exists a graph $G$ with $O(n^{\Delta / 2})$ vertices which contains every $n$-vertex graph with maximum degree $\Delta$ as an induced subgraph. For odd $\Delta$ this significantly improves…

Let $\mathcal{F}$ be a collection of $r$-uniform hypergraphs, and let $0 < p < 1$. It is known that there exists $c = c(p,\mathcal{F})$ such that the probability of a random $r$-graph in $G(n,p)$ not containing an induced subgraph from…

We consider classes of pseudo-random graphs on $n$ vertices for which the degree of every vertex and the co-degree between every pair of vertices are in the intervals $(np - Cn^\delta,np+Cn^\delta)$ and $(np^2- C n^\delta, np^2 +C…

The Graph Reconstruction Conjecture famously posits that any undirected graph on at least three vertices is determined up to isomorphism by its family of (unlabeled) induced subgraphs. At present, the conjecture admits partial resolutions…

Given an $n\times n$ symmetric matrix $W\in [0,1]^{[n]\times [n]}$, let $\mathcal{G}(n,W)$ be the random graph obtained by independently including each edge $jk$ with probability $W_{jk}$. Given a degree sequence ${\bf d}=(d_1,\ldots,…

For a given graph $G$ of minimum degree at least $k$, let $G_p$ denote the random spanning subgraph of $G$ obtained by retaining each edge independently with probability $p=p(k)$. We prove that if $p \ge \frac{\log k + \log \log k +…

We consider random sub-graphs of a fixed graph $G=(V,E)$ with large minimum degree. We fix a positive integer $k$ and let $G_k$ be the random sub-graph where each $v\in V$ independently chooses $k$ random neighbors, making $kn$ edges in…

It follows from the Marcus-Spielman-Srivastava proof of the Kadison-Singer conjecture that if $G=(V,E)$ is a $\Delta$-regular dense expander then there is an edge-induced subgraph $H=(V,E_H)$ of $G$ of constant maximum degree which is also…

Let $G$ be a finite graph with minimum degree $r$. Form a random subgraph $G_p$ of $G$ by taking each edge of $G$ into $G_p$ independently and with probability $p$. We prove that for any constant $\epsilon>0$, if $p=\frac{1+\epsilon}{r}$,…

Let $k \geq 2$ be an integer. Kouider and Lonc proved that the vertex set of every graph $G$ with $n \geq n_0(k)$ vertices and minimum degree at least $n/k$ can be covered by $k - 1$ cycles. Our main result states that for every $\alpha >…

We prove a robust contraction decomposition theorem for $H$-minor-free graphs, which states that given an $H$-minor-free graph $G$ and an integer $p$, one can partition in polynomial time the vertices of $G$ into $p$ sets $Z_1,\dots,Z_p$…

In this paper we show how to use simple partitioning lemmas in order to embed spanning graphs in a typical member of $G(n,p)$. Let the \emph{maximum density} of a graph $H$ be the maximum average degree of all the subgraphs of $H$. First,…