Random hypergraph processes with degree restrictions

DOI10.1007/S00373-004-0571-2zbMATH Open1053.05112OpenAlexW1963702185MaRDI QIDQ704841FDOQ704841

Nicholas Wormald, Catherine Greenhill, Andrzej Ruciński

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

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

Mathematics Subject Classification ID

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

Cited In (6)

• On vertex independence number of uniform hypergraphs
• Title not available (Why is that?)
• On the random greedy \(F\)-free hypergraph process
• The evolution of the min-min random graph process
• The matching process and independent process in random regular graphs and hypergraphs
• Evolution of random graph processes with degree constraints

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)