Almost universal graphs
From MaRDI portal
Publication:5486325
Recommendations
Cited in
(15)- Almost every \(n\)-vertex graph is determined by its \(3 \log_2n\)-vertex subgraphs
- scientific article; zbMATH DE number 4170938 (Why is no real title available?)
- Almost all cop-win graphs contain a universal vertex
- Explicit sparse almost-universal graphs for \(\mathcal G (n, \frac kn)\)
- Feasible graphs with standard universe
- An improved upper bound on the density of universal random graphs
- Expanders are universal for the class of all spanning trees
- scientific article; zbMATH DE number 1882352 (Why is no real title available?)
- Properties of Almost All Graphs and Generalized Quantifiers
- Universal geometric graphs
- Universally signable graphs
- Some remarks on universal graphs
- Graph Traversals as Universal Constructions
- Sharp threshold for the appearance of certain spanning trees in random graphs
- Expanders Are Universal for the Class of All Spanning Trees
This page was built for publication: Almost universal graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5486325)