Diameters of random bipartite graphs

DOI10.1007/BF02579152zbMath0532.05051OpenAlexW2080633915MaRDI QIDQ788749

Victor Klee, Béla Bollobás

Publication date: 1984

Published in: Combinatorica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf02579152

zbMATH Keywords

diameterbipartite graphsconvex properties

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Paths and cycles (05C38) Combinatorial probability (60C05)

Related Items (1)

Bounds on maximum concurrent flow in random bipartite graphs

Cites Work

• Hamiltonian circuits in random graphs
• Multi-Component Systems and Structures and Their Reliability
• On the strength of connectedness of a random graph
• Counting Coloured Graphs of High Connectivity
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Diameters of random bipartite graphs