Asymptotics for Shamir's problem
Author:
- Jeff KahnJKJeff Kahn
- 14 April 2023
- journal article
- research article
- Published by Elsevier in Advances in Mathematics
- Vol. 422
Abstract
No abstract availableKeywords
All Related Versions
Funding Information
- NSF
- National Science Foundation (DMS1501962, DMS1954035)
- Bloom's Syndrome Foundation (2014290)
This publication has 15 references indexed in Scilit:
- Entropy bounds for perfect matchings and Hamiltonian cyclesCombinatorica, 2009
- Factors in random graphsRandom Structures & Algorithms, 2008
- Perfect matchings in random uniform hypergraphsRandom Structures & Algorithms, 2003
- Perfect Matchings in Random r-regular, s-uniform HypergraphsCombinatorics, Probability and Computing, 1996
- Perfect matchings in random s‐uniform hypergraphsRandom Structures & Algorithms, 1995
- Threshold functionsCombinatorica, 1987
- Some intersection theorems for ordered sets and graphsJournal of Combinatorial Theory, Series A, 1986
- A threshold for perfect matchings in random d-pure hypergraphsDiscrete Mathematics, 1983
- On the existence of a factor of degree one of a connected random graphActa Mathematica Hungarica, 1966
- A lower bound for the critical probability in a certain percolation processMathematical Proceedings of the Cambridge Philosophical Society, 1960