Enumerating sparse uniform hypergraphs with given degree sequence and forbidden edges

DOI10.1016/j.ejc.2018.11.002zbMath1404.05083arXiv1805.04991OpenAlexW2963148305MaRDI QIDQ1715626

Haya S. Aldosari, Catherine Greenhill

Publication date: 29 January 2019

Published in: European Journal of Combinatorics (Search for Journal in Brave)

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

zbMATH Keywords

Hamilton cyclesasymptotic enumeration formula

Mathematics Subject Classification ID

Hypergraphs (05C65) Enumeration in graph theory (05C30) Eulerian and Hamiltonian graphs (05C45) Density (toughness, etc.) (05C42)

Related Items (3)

Spanning trees in random regular uniform hypergraphs ⋮ The average number of spanning hypertrees in sparse uniform hypergraphs ⋮ A threshold result for loose Hamiltonicity in random regular uniform hypergraphs

Cites Work

• Unnamed Item
• Asymptotic enumeration of sparse uniform linear hypergraphs with given degrees
• A reductive approach to hypergraph clustering: an application to image segmentation
• Asymptotic enumeration of sparse uniform hypergraphs with given degrees
• Asymptotic enumeration by degree sequence of graphs with degrees \(o(n^{1/2})\)
• Probabilistic existence of regular combinatorial structures
• Approximate counting of regular hypergraphs
• Subgraphs of Dense Random Graphs with Specified Degrees
• Perfect Matchings in Random r-regular, s-uniform Hypergraphs
• The number of graphs and a random graph with a given degree sequence

This page was built for publication: Enumerating sparse uniform hypergraphs with given degree sequence and forbidden edges