Asymptotically optimal induced universal graphs
From MaRDI portal
(Redirected from Publication:521601)
Recommendations
Cites work
- scientific article; zbMATH DE number 3168330 (Why is no real title available?)
- scientific article; zbMATH DE number 5720940 (Why is no real title available?)
- scientific article; zbMATH DE number 3922707 (Why is no real title available?)
- scientific article; zbMATH DE number 3943863 (Why is no real title available?)
- scientific article; zbMATH DE number 863496 (Why is no real title available?)
- scientific article; zbMATH DE number 894528 (Why is no real title available?)
- scientific article; zbMATH DE number 3223737 (Why is no real title available?)
- scientific article; zbMATH DE number 3303831 (Why is no real title available?)
- Adjacency labeling schemes and induced-universal graphs
- Bipartite decomposition of random graphs
- Cliques in random graphs
- Graphs which contain all small graphs
- Implicat Representation of Graphs
- Induced-universal graphs for graphs with bounded maximum degree
- Limit distribution for the existence of Hamiltonian cycles in a random graph
- On induced-universal graphs for the class of bounded-degree graphs
- On minimal n-universal graphs
- On the order of uniprimitive permutation groups
- On the orders of Primitive Permutation Groups
- Optimal induced universal graphs and adjacency labeling for trees
- Permutation groups, minimal degrees and quantum computing.
- Ramsey properties of orientations of graphs
- SOME UNSOLVED PROBLEMS IN GRAPH THEORY
- Shorter Implicit Representation for Planar Graphs and Bounded Treewidth Graphs
- The Maximum Order of the Group of a Tournament
- The probabilistic method
- Universal graphs and induced-universal graphs
- Universal graphs and universal functions
Cited in
(26)- Universal arrays
- Isometric universal graphs
- Asymptotically optimal induced decompositions
- Optimal induced universal graphs for bounded-degree graphs
- Lower bounds for superpatterns and universal sequences
- Exoticn-universal graphs
- Supertrees
- Universality, tolerance, chaos and order
- Universality of random permutations
- Complexity and randomness in the Heisenberg groups (and beyond)
- Addressing Johnson graphs, complete multipartite graphs, odd cycles, and random graphs
- scientific article; zbMATH DE number 1882352 (Why is no real title available?)
- On universality of graphs with uniformly distributed edges
- Induced universal hypergraphs
- scientific article; zbMATH DE number 7765385 (Why is no real title available?)
- Adjacency labeling schemes and induced-universal graphs
- Shorter Labeling Schemes for Planar Graphs
- Near-Optimal Induced Universal Graphs for Bounded Degree Graphs
- Branch-depth: generalizing tree-depth of graphs
- Implicit representation of sparse hereditary families
- Right-angled Coxeter groups, universal graphs, and Eulerian polynomials
- Isomorphisms between random graphs
- Near-optimal induced universal graphs for cycles and paths
- Quasipolynomiality of the Smallest Missing Induced Subgraph
- An adjacency labeling scheme based on a decomposition of trees into caterpillars
- Induced-universal graphs for graphs with bounded maximum degree
This page was built for publication: Asymptotically optimal induced universal graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q521601)
