Connectivity of the linear uniform hypergraph process

DOI10.1016/J.DISC.2022.113056MaRDI QIDQ2166301zbMATH OpenOpenAlexWikidataFDO

Authors Fang Tian

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

zbMATH Keywords

asymptotic enumerationconnectivitygraph processlinear hypergraph

Mathematics Subject Classification ID

Asymptotic enumeration (05A16) Enumeration in graph theory (05C30) Connectivity (05C40) Hypergraphs (05C65)

Recommendations

• Threshold and hitting time for high-order connectedness in random hypergraphs
• On the strength of connectedness of a random hypergraph
• scientific article; zbMATH DE number 3857159
• Evolution of high-order connected components in random hypergraphs
• The asymptotic number of connected \(d\)-uniform hypergraphs

Cites work

• Asymptotic enumeration of linear hypergraphs with given number of vertices and edges
• Asymptotic enumeration of non-uniform linear hypergraphs
• scientific article; zbMATH DE number 3943863 (Why is no real title available?)
• Large girth approximate Steiner triple systems
• On the number of linear hypergraphs of large girth
• On the number of linear multipartite hypergraphs with given size
• On the strength of connectedness of a random hypergraph

Cited in

(3)

• Threshold and hitting time for high-order connectedness in random hypergraphs
• Minimally connected \(r\)-uniform hypergraphs
• On the random greedy linear uniform hypergraph packing

This page was built for publication: Connectivity of the linear uniform hypergraph process

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