Related papers: Sharp thresholds for spanning regular subgraphs

Let $d\geq 3$ be a constant and let $F$ be a $d$-regular graph on $[n]$ with not too many symmetries. By the union bound, the probability threshold for the existence of a spanning subgraph in $G(n,p)$ isomorphic to $F$ is at least…

We show that $p=\sqrt{\frac{e}{n}}$ is a sharp threshold for the random graph $G_{n,p}$ to contain the square of a Hamilton cycle. This improves the previous results of K\"uhn and Osthus and also Nenadov and \v{S}kori\'c.

In this paper we show that $e/n$ is the sharp threshold for the existence of tight Hamilton cycles in random $k$-uniform hypergraphs, for all $k\ge 4$. When $k=3$ we show that $1/n$ is an asymptotic threshold. We also determine thresholds…

We determine the sharp threshold for Hamilton cycles in randomly perturbed sparse graphs. For any $\alpha=\alpha(n)=o(1)$, let $G_{\alpha}$ be an $n$-vertex graph with minimum degree $\delta(G_{\alpha})\ge\alpha n$. We prove that if…

For $k \geq 4$, we establish that $p = (e/n)^{1/k}$ is a sharp threshold for the existence of the $k$-th power $H$ of a Hamilton cycle in the binomial random graph model. Our proof builds upon an approach by Riordan based on the second…

Resolving a conjecture of K\"uhn and Osthus from 2012, we show that $p= 1/\sqrt{n}$ is the threshold for the random graph $G_{n,p}$ to contain the square of a Hamilton cycle.

We extend a recent argument of Kahn, Narayanan and Park (Proceedings of the AMS, to appear) about the threshold for the appearance of the square of a Hamilton cycle to other spanning structures. In particular, for any spanning graph, we…

We show that the threshold for the random graph $G_{n,p}$ to contain the square of a Hamilton cycle is $p=\frac{1}{\sqrt{n}}$. This improves the previous results of K\"uhn and Osthus and also Nenadov and \v{S}kori\'c. In addition we…

We show for an arbitrary $\ell_p$ norm that the property that a random geometric graph $\mathcal G(n,r)$ contains a Hamiltonian cycle exhibits a sharp threshold at $r=r(n)=\sqrt{\frac{\log n}{\alpha_p n}}$, where $\alpha_p$ is the area of…

A Hamiltonian cycle in a graph is a spanning subgraph that is homeomorphic to a circle. With this in mind, it is natural to define a Hamiltonian d-sphere in a d-dimensional simplicial complex as a spanning subcomplex that is homeomorphic to…

For positive integers $r > \ell$, an $r$-uniform hypergraph is called an $\ell$-cycle if there exists a cyclic ordering of its vertices such that each of its edges consists of $r$ consecutive vertices, and such that every pair of…

For positive integers $n$ and $k$ with $n\geq 2k+1$, the Kneser graph $K(n,k)$ is the graph with vertex set consisting of all $k$-sets of $\{1,\dots,n\}$, where two $k$-sets are adjacent exactly when they are disjoint. The independent sets…

When $k|n$, the tree $\mathrm{Comb}_{n,k}$ consists of a path containing $n/k$ vertices, each of whose vertices has a disjoint path length $k-1$ beginning at it. We show that, for any $k=k(n)$ and $\epsilon>0$, the binomial random graph…

We find the threshold for the existence of a collection of edge disjoint copies of $K_r$ that form a cyclic structure and span all vertices of $G_{n,p}$. We use a recent result of Riordan to give a two line proof of the main result.

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…

We investigate the appearance of the square of a Hamilton cycle in the model of randomly perturbed graphs, which is, for a given $\alpha \in (0,1)$, the union of any $n$-vertex graph with minimum degree $\alpha n$ and the binomial random…

We consider the Erd\H{o}s-R\'enyi evolution of random graphs, where a new uniformly distributed edge is added to the graph in every step. For every fixed $d\ge 1$, we show that with high probability, the graph becomes rigid in $\mathbb R^d$…

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 +…

Consider the random subgraph process on a base graph $G$ with $n$ vertices: we generate a sequence $\{G_t\}_{t=0}^{|E(G)|}$ by taking a uniformly random ordering of the edges of $G$ and then adding these edges one by one to the empty graph…

We prove that the property of containing a $k$-regular subgraph in the random graph model $G(n,p)$ has a sharp threshold for $k\ge3$. We also show how to use similar methods to obtain an easy prove for the (known fact of) sharpness of…