# Random triangles in random graphs

@article{Heckel2018RandomTI,
title={Random triangles in random graphs},
author={Annika Heckel},
journal={arXiv: Combinatorics},
year={2018}
}
• A. Heckel
• Published 23 February 2018
• Mathematics
• arXiv: Combinatorics
In a recent paper, Oliver Riordan shows that for $r \ge 4$ and $p$ up to and slightly larger than the threshold for a $K_r$-factor, the hypergraph formed by the copies of $K_r$ in $G(n,p)$ contains a copy of the binomial random hypergraph $H=H_r(n,\pi)$ with $\pi \sim p^{r \choose 2}$. For $r=3$, he gives a slightly weaker result where the density in the random hypergraph is reduced by a constant factor. Recently, Jeff Kahn announced an asymptotically sharp bound for the threshold in Shamir's… Expand
Random cliques in random graphs
We show that for each $r\ge 4$, in a density range extending up to, and slightly beyond, the threshold for a $K_r$-factor, the copies of $K_r$ in the random graph $G(n,p)$ are randomly distributed,Expand
Asymptotics for Shamir's Problem
For fixed $r\geq 3$ and $n$ divisible by $r$, let ${\mathcal H}={\mathcal H}^r_{n,M}$ be the random $M$-edge $r$-graph on $V=\{1,\ldots ,n\}$; that is, ${\mathcal H}$ is chosen uniformly from theExpand
Hitting times for Shamir’s problem
• J. Kahn
• Mathematics
• Transactions of the American Mathematical Society
• 2021
For fixed $r\geq 3$ and $n$ divisible by $r$, let ${\mathcal H}={\mathcal H}^r_{n,M}$ be the random $M$-edge $r$-graph on $V=\{1,\ldots ,n\}$; that is, ${\mathcal H}$ is chosen uniformly from theExpand
Thresholds versus fractional expectation-thresholds
• Mathematics, Computer Science
• Annals of Mathematics
• 2021
The 'axial' version of the random multi-dimensional assignment problem (earlier considered by Martin--M\'{e}zard--Rivoire and Frieze--Sorkin) is resolved and the Erd\H{o}s--Rado 'Sunflower Conjecture' is solved. Expand
Spanning $F$-cycles in random graphs
• Mathematics
• 2021
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. InExpand
A note on spanning Kr-cycles in random graphs
We find a close approximation to 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 recentExpand
Hamilton Cycles in Random Graphs: a bibliography
We provide an annotated bibliography for the study of Hamilton cycles in random graphs and hypergraphs.