@article{11706,
  abstract     = {We say that (Formula presented.) if, in every edge coloring (Formula presented.), we can find either a 1-colored copy of (Formula presented.) or a 2-colored copy of (Formula presented.). The well-known states that the threshold for the property (Formula presented.) is equal to (Formula presented.), where (Formula presented.) is given by (Formula presented.) for any pair of graphs (Formula presented.) and (Formula presented.) with (Formula presented.). In this article, we show the 0-statement of the Kohayakawa–Kreuter conjecture for every pair of cycles and cliques. },
  author       = {Liebenau, Anita and Mattos, Letícia and Mendonca Dos Santos, Walner and Skokan, Jozef},
  issn         = {1098-2418},
  journal      = {Random Structures and Algorithms},
  number       = {4},
  pages        = {1035--1055},
  publisher    = {Wiley},
  title        = {{Asymmetric Ramsey properties of random graphs involving cliques and cycles}},
  doi          = {10.1002/rsa.21106},
  volume       = {62},
  year         = {2023},
}

@article{9565,
  abstract     = {Let D(n,p) be the random directed graph on n vertices where each of the n(n-1) possible arcs is present independently with probability p. A celebrated result of Frieze shows that if p≥(logn+ω(1))/n then D(n,p) typically has a directed Hamilton cycle, and this is best possible. In this paper, we obtain a strengthening of this result, showing that under the same condition, the number of directed Hamilton cycles in D(n,p) is typically n!(p(1+o(1)))n. We also prove a hitting-time version of this statement, showing that in the random directed graph process, as soon as every vertex has in-/out-degrees at least 1, there are typically n!(logn/n(1+o(1)))n directed Hamilton cycles.},
  author       = {Ferber, Asaf and Kwan, Matthew Alan and Sudakov, Benny},
  issn         = {1098-2418},
  journal      = {Random Structures and Algorithms},
  number       = {4},
  pages        = {592--603},
  publisher    = {Wiley},
  title        = {{Counting Hamilton cycles in sparse random directed graphs}},
  doi          = {10.1002/rsa.20815},
  volume       = {53},
  year         = {2018},
}

@article{9567,
  abstract     = {Let P be a graph property which is preserved by removal of edges, and consider the random graph process that starts with the empty n-vertex graph and then adds edges one-by-one, each chosen uniformly at random subject to the constraint that P is not violated. These types of random processes have been the subject of extensive research over the last 20 years, having striking applications in extremal combinatorics, and leading to the discovery of important probabilistic tools. In this paper we consider the k-matching-free process, where P is the property of not containing a matching of size k. We are able to analyse the behaviour of this process for a wide range of values of k; in particular we prove that if k=o(n) or if n−2k=o(n−−√/logn) then this process is likely to terminate in a k-matching-free graph with the maximum possible number of edges, as characterised by Erdős and Gallai. We also show that these bounds on k are essentially best possible, and we make a first step towards understanding the behaviour of the process in the intermediate regime.},
  author       = {Krivelevich, Michael and Kwan, Matthew Alan and Loh, Po‐Shen and Sudakov, Benny},
  issn         = {1098-2418},
  journal      = {Random Structures and Algorithms},
  number       = {4},
  pages        = {692--716},
  publisher    = {Wiley},
  title        = {{The random k‐matching‐free process}},
  doi          = {10.1002/rsa.20814},
  volume       = {53},
  year         = {2018},
}

@article{9568,
  abstract     = {An intercalate in a Latin square is a 2×2 Latin subsquare. Let N be the number of intercalates in a uniformly random n×n Latin square. We prove that asymptotically almost surely N≥(1−o(1))n2/4, and that EN≤(1+o(1))n2/2 (therefore asymptotically almost surely N≤fn2 for any f→∞). This significantly improves the previous best lower and upper bounds. We also give an upper tail bound for the number of intercalates in two fixed rows of a random Latin square. In addition, we discuss a problem of Linial and Luria on low-discrepancy Latin squares.},
  author       = {Kwan, Matthew Alan and Sudakov, Benny},
  issn         = {1098-2418},
  journal      = {Random Structures and Algorithms},
  number       = {2},
  pages        = {181--196},
  publisher    = {Wiley},
  title        = {{Intercalates and discrepancy in random Latin squares}},
  doi          = {10.1002/rsa.20742},
  volume       = {52},
  year         = {2018},
}

@article{11883,
  abstract     = {In dynamic graph algorithms the following provide-or-bound problem has to be solved quickly: Given a set S containing a subset R and a way of generating random elements from S testing for membership in R, either (i) provide an element of R, or (ii) give a (small) upper bound on the size of R that holds with high probability. We give an optimal algorithm for this problem. This algorithm improves the time per operation for various dynamic graph algorithms by a factor of O(log n). For example, it improves the time per update for fully dynamic connectivity from O(log3n) to O(log2n).},
  author       = {Henzinger, Monika H and Thorup, Mikkel},
  issn         = {1098-2418},
  journal      = {Random Structures and Algorithms},
  number       = {4},
  pages        = {369--379},
  publisher    = {Wiley},
  title        = {{Sampling to provide or to bound: With applications to fully dynamic graph algorithms}},
  doi          = {10.1002/(sici)1098-2418(199712)11:4<369::aid-rsa5>3.0.co;2-x},
  volume       = {11},
  year         = {1997},
}