scientific article; zbMATH DE number 3999977
From MaRDI portal
Publication:4726286
zbMATH Open0617.05050MaRDI QIDQ4726286FDOQ4726286
Authors: Wojciech Kordecki 
Publication date: 1985
Title of this publication is not available (Why is that?)
Random graphs (graph-theoretic aspects) (05C80) Connectivity (05C40) Hypergraphs (05C65) Zero-one laws (60F20)
Cited In (11)
- On a Connectivity Threshold for Colorings of Random Graphs and Hypergraphs
- COUNTABLY APPROXIMATING FRAMES
- Random lifts of graphs are highly connected
- On the random greedy \(F\)-free hypergraph process
- On the connectivity of graphs generated by a sum of random mappings
- Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques
- Title not available (Why is that?)
- Structure of large random hypergraphs
- On the strength of connectedness of a random hypergraph
- When are random graphs connected
- A random link via bridge position is hyperbolic
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4726286)
