Asymptotics for Shamir's problem

DOI10.1016/J.AIM.2023.109019MaRDI QIDQ2700633zbMATH OpenOpenAlexFDO

Authors J. Kahn

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

zbMATH Keywords

hitting timesperfect matchingsrandom hypergraphsShamir's problemthresholds

Mathematics Subject Classification ID

Permutations, words, matrices (05A05) Hypergraphs (05C65) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Random graphs (graph-theoretic aspects) (05C80) Transversal (matching) theory (05D15) Probabilistic methods in extremal combinatorics, including polynomial methods (combinatorial Nullstellensatz, etc.) (05D40)

Recommendations

• Hitting times for Shamir's problem
• Perfect Matchings in Random r-regular, s-uniform Hypergraphs
• Factors in random graphs
• Perfect matchings in random s‐uniform hypergraphs
• Perfect matchings in uniform hypergraphs with large minimum degree

Cites work

• A threshold for perfect matchings in random d-pure hypergraphs
• An entropy proof of the Kahn-Lovász theorem
• Entropy bounds for perfect matchings and Hamiltonian cycles
• Factors in random graphs
• Hitting times for Shamir's problem
• scientific article; zbMATH DE number 3168330 (Why is no real title available?)
• scientific article; zbMATH DE number 3943863 (Why is no real title available?)
• scientific article; zbMATH DE number 107482 (Why is no real title available?)
• scientific article; zbMATH DE number 3458807 (Why is no real title available?)
• scientific article; zbMATH DE number 1540669 (Why is no real title available?)
• scientific article; zbMATH DE number 949656 (Why is no real title available?)
• scientific article; zbMATH DE number 3198427 (Why is no real title available?)
• Information theory. Coding theorems for discrete memoryless systems
• Introduction to Random Graphs
• On the combinatorial problems which I would most like to see solved
• On the existence of a factor of degree one of a connected random graph
• Perfect fractional matchings in \(k\)-out hypergraphs
• Perfect Matchings in Random r-regular, s-uniform Hypergraphs
• Perfect matchings in random s‐uniform hypergraphs
• Perfect matchings in random uniform hypergraphs
• Random cliques in random graphs and sharp thresholds for F$$ F $$‐factors
• Random triangles in random graphs
• Some intersection theorems for ordered sets and graphs
• The maximum number of perfect matchings in graphs with a given degree sequence
• Threshold functions

Cited in

(10)

• Hitting times for Shamir's problem
• Combinatorics, probability and computing. Abstracts from the workshop held April 24--30, 2022
• Threshold for Steiner triple systems
• Asymptotics for Shamir's Problem
• The hitting time of clique factors
• A note on non-isomorphic edge-color classes in random graphs
• Searching for (sharp) thresholds in random structures: where are we now?
• The random graph process is globally synchronizing
• Vertex-critical graphs far from edge-criticality
• Clique factors in pseudorandom graphs

This page was built for publication: Asymptotics for Shamir's problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2700633)