scientific article; zbMATH DE number 1882352

zbMATH Open1008.05139MaRDI QIDQ4797464FDOQ4797464

Authors: Aleksej Dmitrievich Korshunov 

Publication date: 16 March 2003

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

Recommendations

• Almost every \(n\)-vertex graph is determined by its \(3 \log_2n\)-vertex subgraphs
• Almost universal graphs
• scientific article; zbMATH DE number 3948308
• Asymptotically optimal induced universal graphs
• Explicit sparse almost-universal graphs for \(\mathcal G (n, \frac kn)\)

zbMATH Keywords

\(k\)-universal graphKolmogorov random graph

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Extremal problems in graph theory (05C35)

Cited In (5)

• Title not available (Why is that?)
• Almost universal graphs
• On the number of unique subgraphs of a graph
• Almost every \(n\)-vertex graph is determined by its \(3 \log_2n\)-vertex subgraphs
• On the capacity of graphs

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