Spanning trees in random regular uniform hypergraphs

DOI10.1017/S0963548321000158MaRDI QIDQ5886306zbMATH OpenOpenAlexFDO

Authors Catherine Greenhill, M. I. Isaev

Publication date 31 March 2023

Published in Combinatorics, Probability and Computing (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/2005.07350

zbMATH Keywords

Berge acyclicityCayley's formulauniform hypergraphs

Mathematics Subject Classification ID

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

Recommendations

• The average number of spanning hypertrees in sparse uniform hypergraphs
• Spanning structures and universality in sparse hypergraphs
• On the number of spanning trees in random regular graphs
• A threshold result for loose Hamiltonicity in random regular uniform hypergraphs
• Spanning trees in random graphs

Cites work

• A probabilistic proof of an asymptotic formula for the number of labelled regular graphs
• A threshold result for loose Hamiltonicity in random regular uniform hypergraphs
• Almost all cubic graphs are Hamiltonian
• Almost all regular graphs are hamiltonian
• Efficient Prüfer-like coding and counting labelled hypertrees
• Enumerating sparse uniform hypergraphs with given degree sequence and forbidden edges
• Generalized loop-erased random walks and approximate reachability
• scientific article; zbMATH DE number 3873374 (Why is no real title available?)
• scientific article; zbMATH DE number 3769673 (Why is no real title available?)
• scientific article; zbMATH DE number 3773632 (Why is no real title available?)
• scientific article; zbMATH DE number 3606484 (Why is no real title available?)
• scientific article; zbMATH DE number 1342092 (Why is no real title available?)
• scientific article; zbMATH DE number 729555 (Why is no real title available?)
• scientific article; zbMATH DE number 1163724 (Why is no real title available?)
• scientific article; zbMATH DE number 3447208 (Why is no real title available?)
• scientific article; zbMATH DE number 863476 (Why is no real title available?)
• scientific article; zbMATH DE number 3340110 (Why is no real title available?)
• On the Desirability of Acyclic Database Schemes
• On the number of perfect matchings in random lifts
• On the number of spanning trees in random regular graphs
• Perfect Matchings in Random r-regular, s-uniform Hypergraphs
• Random Regular Graphs: Asymptotic Distributions and Contiguity
• Spectra of random regular hypergraphs
• The asymptotic number of labeled graphs with given degree sequences
• The average number of spanning hypertrees in sparse uniform hypergraphs

Cited in

(9)

• The local limit of the uniform spanning tree on dense graphs
• The average number of spanning hypertrees in sparse uniform hypergraphs
• Spanning trees in random series-parallel graphs
• Spanning structures and universality in sparse hypergraphs
• On spanning structures in random hypergraphs
• On the number of spanning trees in random regular graphs
• Random recursive hypergraphs
• Simplicial spanning trees in random Steiner complexes
• Higher-order group synchronization

This page was built for publication: Spanning trees in random regular uniform hypergraphs

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