scientific article; zbMATH DE number 18979

zbMATH Open0753.05060MaRDI QIDQ3976404FDOQ3976404

Authors: Fan Chung 

Publication date: 26 June 1992

Title of this publication is not available (Why is that?)

Recommendations

• scientific article; zbMATH DE number 3924802
• scientific article; zbMATH DE number 18978
• scientific article; zbMATH DE number 1231233
• scientific article; zbMATH DE number 1540669
• Random Graphs
• scientific article; zbMATH DE number 5610906
• scientific article; zbMATH DE number 3875330
• scientific article; zbMATH DE number 863475
• scientific article; zbMATH DE number 3904630
• scientific article; zbMATH DE number 857026

zbMATH Keywords

communication networkstheoretical computer sciencerandom-like graphs

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Graph theory (including graph drawing) in computer science (68R10) Applications of graph theory to circuits and networks (94C15)

Cited In (10)

• The complexity of explicit constructions
• A new series of dense graphs of high girth
• Normalized Laplacian eigenvalues of hypergraphs
• Hermitian matrices and graphs: Singular values and discrepancy
• Palindromic characteristic of committed graphs and some model theoretic properties
• Explicit construction of graphs with an arbitrary large girth and of large size
• Construction of expanders and superconcentrators using Kolmogorov complexity
• The complexity of explicit constructions
• Optimal bounds for single-source Kolmogorov extractors
• Logarithmic reduction of the level of randomness in some probabilistic geometric constructions

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 Q3976404)