A Pittel-type limit law for the largest component of random d-uniform hypergraphs: enumeration and excursions

arXiv:2610.27276 · math.CO, math.PR · Submitted 2026-10-19 · Read on arXiv

math.CO, math.PR

Submitted: 2026-10-19

Updated: 2026-10-19

Terminology

• Hypergraph — 1× in this paper · explained in 2 episodes
• Hypergraphs — 1× in this paper · explained in 2 episodes

Related papers

• Exponential random graph models with soft clique constraints
• Two Linear Programs are Better than One
• Exact Enumeration of Phylogenetic Networks: The Tree-Child, Reticulation-Visible and Orchard Hierarchy
• A complete classification of perfect state transfer in Grover walks on abelian Cayley graphs
• Arithmetic Circuits and Neural Networks for Regular Matroids
• On composition and decomposition operations for vector spaces, graphs and matroids