Hitting times for Shamir’s problem

Jeff Kahn

Type: Article

Publication Date: 2021-07-07

Citations: 9

DOI: https://doi.org/10.1090/tran/8508

View Publication

Locations

arXiv (Cornell University) - View - PDF
Transactions of the American Mathematical Society - View

Similar Works

Action	Title	Year	Authors
+	Hitting times for Shamir's Problem	2020	Jeff Kahn
+	Hitting times for Shamir's Problem	2020	Jeff Kahn
+	Asymptotics for Shamir's Problem	2019	Jeff Kahn
+ PDF Chat	Asymptotics for Shamir's problem	2023	Jeff Kahn
+	Random cliques in random graphs	2018	Oliver Riordan
+	The hitting time of clique factors	2023	Annika Heckel Marc Kaufmann Noëla Müller Matija Pasch
+	Erdős-Szekeres type Theorems for ordered uniform matchings	2023	Andrzej Dudek Jarosław Grytczuk Andrzej Ruciński
+	Maximum matchings in sparse random graphs: Karp-Sipser revisited	1998	Jonathan D. Aronson Alan Frieze Boris Pittel
+	Maximum Matchings in Random Bipartite Graphs and the Space Utilization of Cuckoo Hashtables	2009	Alan Frieze Páll Melsted
+ PDF Chat	A sharp threshold for van der Waerden's theorem in random subsets	2016	Mathias Schacht Yury Person Hiệp Hàn Ehud Friedgut
+	Large cliques and independent sets all over the place	2020	Noga Alon Matija Bucić Benny Sudakov
+	Sharp threshold for the Erd\H{o}s-Ko-Rado theorem	2021	József Balogh Robert A. Krueger Haoran Luo
+	Two problems on matchings in set families - in the footsteps of Erdős and Kleitman	2016	Péter Frankl Andrey Kupavskii
+	Perfect matchings in random sparsifications of Dirac hypergraphs	2022	Dong Yeap Kang Tom Kelly Daniela Kühn Deryk Osthus Vincent Pfenninger
+ PDF Chat	Hitting times in the binomial random graph	2024	Bertille Granet Felix Joos Jonathan Schrodt
+	Matchings Meeting Quotas and Their Impact on the Blow-Up Lemma	2001	Vojtěch Rödl Andrzej Ruciński Michelle Wagner
+	Ramsey games near the critical threshold	2019	David Conlon Shagnik Das Joonkyung Lee Tamás Mészáros
+	Two problems on matchings in set families - in the footsteps of Erd\H{o}s and Kleitman	2016	Péter Frankl Andrey Kupavskii
+	The anti-Ramsey threshold of complete graphs	2019	Yoshiharu Kohayakawa Guilherme Oliveira Mota Olaf Parczyk Jakob Schnitzer
+	Perfect matchings in random intersection graphs	2012	Mindaugas Bloznelis Tomasz Łuczak

Works That Cite This (8)

Action	Title	Year	Authors
+ PDF Chat	Asymptotics for Shamir's problem	2023	Jeff Kahn
+	The hitting time of clique factors	2023	Annika Heckel Marc Kaufmann Noëla Müller Matija Pasch
+ PDF Chat	A robust Corrádi–Hajnal theorem	2024	Peter Allen Julia Böttcher Jan Corsten Ewan Davies Matthew Jenssen Patrick Morris Barnaby Roberts Jozef Skokan
+ PDF Chat	Multitrees in Random Graphs	2023	Alan Frieze Wesley Pegden
+	Random cliques in random graphs and sharp thresholds for F$$ F $$‐factors	2022	Oliver Riordan
+	Perfect Matchings in Random Sparsifications of Dirac Hypergraphs	2024	Dong Yeap Kang Tom Kelly Daniela Kühn Deryk Osthus Vincent Pfenninger
+ PDF Chat	Threshold for Steiner triple systems	2023	Ashwin Sah Mehtaab Sawhney Michael Simkin
+ PDF Chat	The hitting time of clique factors	2024	Annika Heckel Marc Kaufmann Noëla Müller Matija Pasch

Works Cited by This (21)

Action	Title	Year	Authors
+	Random Graphs of Small Order	1985	Béla Bollobás Andrew Thomason
+	Models of Random Regular Graphs	1999	N. C. Wormald
+	A threshold for perfect matchings in random d-pure hypergraphs	1983	Jeanette P. Schmidt Eli Shamir
+	Lopsided Lovász Local Lemma and Latin transversals	1991	P. Erdős Joel Spencer
+ PDF Chat	A BK inequality for randomly drawn subsets of fixed size	2011	Jacob van den Berg Johan Jonasson
+ PDF Chat	Thresholds and Expectation Thresholds	2007	Jeff Kahn Gil Kalai
+	Perfect matchings in random s‐uniform hypergraphs	1995	Alan Frieze Svante Janson
+	Inequalities with applications to percolation and reliability	1985	J. van den Berg Harry Kesten
+	Asymptotic enumeration by degree sequence of graphs with degreeso(n 1/2)	1991	Brendan D. McKay Nicholas Wormald
+	None	2008	Anders Johansson Jeff Kahn Van Vu