Random hypergraph processes with degree restrictions

DOI10.1007/S00373-004-0571-2MaRDI QIDQ704841zbMATH OpenOpenAlexFDO

Authors Catherine Greenhill, Andrzej Ruciński, Nicholas Wormald

Publication date 20 January 2005

Published in Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s00373-004-0571-2

Mathematics Subject Classification ID

Hypergraphs (05C65) Random graphs (graph-theoretic aspects) (05C80) Combinatorial probability (60C05)

Recommendations

• Random Graph Processes with Degree Restrictions
• The matching process and independent process in random regular graphs and hypergraphs
• On the strength of connectedness of a random hypergraph
• On the random greedy F-free hypergraph process
• On the random greedy \(F\)-free hypergraph process

Cited in

(11)

• The evolution of the min-min random graph process
• The matching process and independent process in random regular graphs and hypergraphs
• On the random greedy F-free hypergraph process
• Evolution of random graph processes with degree constraints
• scientific article; zbMATH DE number 5485245 (Why is no real title available?)
• On vertex independence number of uniform hypergraphs
• Random Graph Processes with Degree Restrictions
• The stripping process can be slow. I.
• The degree-restricted random process is far from uniform
• Randomized algorithms to generate hypergraphs with given degree sequences
• Sharper analysis of the random graph d-process via a balls-in-bins model

This page was built for publication: Random hypergraph processes with degree restrictions

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