Asymptotics for Shamir's problem
From MaRDI portal
Publication:2700633
DOI10.1016/j.aim.2023.109019OpenAlexW2972456824MaRDI QIDQ2700633
Publication date: 27 April 2023
Published in: Advances in Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1909.06834
Random graphs (graph-theoretic aspects) (05C80) Hypergraphs (05C65) Permutations, words, matrices (05A05) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Transversal (matching) theory (05D15) Probabilistic methods in extremal combinatorics, including polynomial methods (combinatorial Nullstellensatz, etc.) (05D40)
Related Items (2)
Combinatorics, probability and computing. Abstracts from the workshop held April 24--30, 2022 ⋮ Threshold for Steiner triple systems
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Entropy bounds for perfect matchings and Hamiltonian cycles
- An entropy proof of the Kahn-Lovász theorem
- The maximum number of perfect matchings in graphs with a given degree sequence
- Threshold functions
- Some intersection theorems for ordered sets and graphs
- On the combinatorial problems which I would most like to see solved
- A threshold for perfect matchings in random d-pure hypergraphs
- Perfect fractional matchings in \(k\)-out hypergraphs
- Introduction to Random Graphs
- Factors in random graphs
- Perfect matchings in random uniform hypergraphs
- Perfect matchings in random s‐uniform hypergraphs
- Perfect Matchings in Random r-regular, s-uniform Hypergraphs
- Hitting times for Shamir’s problem
- On the existence of a factor of degree one of a connected random graph
- Information Theory
- Random cliques in random graphs and sharp thresholds for F$$ F $$‐factors
- Random triangles in random graphs
This page was built for publication: Asymptotics for Shamir's problem
