Connectivity of the linear uniform hypergraph process
From MaRDI portal
Publication:2166301
DOI10.1016/j.disc.2022.113056zbMath1495.05159OpenAlexW4283270940WikidataQ114190496 ScholiaQ114190496MaRDI QIDQ2166301
Publication date: 24 August 2022
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disc.2022.113056
Hypergraphs (05C65) Enumeration in graph theory (05C30) Asymptotic enumeration (05A16) Connectivity (05C40)
Related Items (1)
Cites Work
- Unnamed Item
- On the number of linear multipartite hypergraphs with given size
- Asymptotic enumeration of non-uniform linear hypergraphs
- Asymptotic enumeration of linear hypergraphs with given number of vertices and edges
- On the strength of connectedness of a random hypergraph
- On the number of linear hypergraphs of large girth
- Large girth approximate Steiner triple systems
This page was built for publication: Connectivity of the linear uniform hypergraph process