TY - JOUR AB - 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. AU - Krivelevich, Michael AU - Kwan, Matthew Alan AU - Loh, Po‐Shen AU - Sudakov, Benny ID - 9567 IS - 4 JF - Random Structures and Algorithms SN - 1042-9832 TI - The random k‐matching‐free process VL - 53 ER - TY - JOUR AB - 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. AU - Ferber, Asaf AU - Kwan, Matthew Alan AU - Sudakov, Benny ID - 9565 IS - 4 JF - Random Structures and Algorithms SN - 1042-9832 TI - Counting Hamilton cycles in sparse random directed graphs VL - 53 ER - TY - JOUR AB - 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. AU - Kwan, Matthew Alan AU - Sudakov, Benny ID - 9568 IS - 2 JF - Random Structures and Algorithms SN - 1042-9832 TI - Intercalates and discrepancy in random Latin squares VL - 52 ER - TY - JOUR AB - We say a family of sets is intersecting if any two of its sets intersect, and we say it is trivially intersecting if there is an element which appears in every set of the family. In this paper we study the maximum size of a non-trivially intersecting family in a natural “multi-part” setting. Here the ground set is divided into parts, and one considers families of sets whose intersection with each part is of a prescribed size. Our work is motivated by classical results in the single-part setting due to Erdős, Ko and Rado, and Hilton and Milner, and by a theorem of Frankl concerning intersecting families in this multi-part setting. In the case where the part sizes are sufficiently large we determine the maximum size of a non-trivially intersecting multi-part family, disproving a conjecture of Alon and Katona. AU - Kwan, Matthew Alan AU - Sudakov, Benny AU - Vieira, Pedro ID - 9587 JF - Journal of Combinatorial Theory Series A SN - 0097-3165 TI - Non-trivially intersecting multi-part families VL - 156 ER - TY - JOUR AB - We investigate the thermodynamics and kinetics of a hydrogen interstitial in magnetic α-iron, taking account of the quantum fluctuations of the proton as well as the anharmonicities of lattice vibrations and hydrogen hopping. We show that the diffusivity of hydrogen in the lattice of bcc iron deviates strongly from an Arrhenius behavior at and below room temperature. We compare a quantum transition state theory to explicit ring polymer molecular dynamics in the calculation of diffusivity. We then address the trapping of hydrogen by a vacancy as a prototype lattice defect. By a sequence of steps in a thought experiment, each involving a thermodynamic integration, we are able to separate out the binding free energy of a proton to a defect into harmonic and anharmonic, and classical and quantum contributions. We find that about 30% of a typical binding free energy of hydrogen to a lattice defect in iron is accounted for by finite temperature effects, and about half of these arise from quantum proton fluctuations. This has huge implications for the comparison between thermal desorption and permeation experiments and standard electronic structure theory. The implications are even greater for the interpretation of muon spin resonance experiments. AU - Cheng, Bingqing AU - Paxton, Anthony T. AU - Ceriotti, Michele ID - 9665 IS - 22 JF - Physical Review Letters SN - 0031-9007 TI - Hydrogen diffusion and trapping in α-iron: The role of quantum and anharmonic fluctuations VL - 120 ER -