Universal graphs and universal functions
From MaRDI portal
Cited in
(only showing first 100 items - show all)- A proof of the rooted tree alternative conjecture
- On the problem of finding small subdivision and homomorphism bases for classes of countable graphs
- Cyclic automorphisms of a countable graph and random sum-free sets
- On universal graphs with forbidden topological subgraphs
- Simplicial decompositions of graphs: A survey of applications
- Some universal graphs
- Chromatically optimal rigid graphs
- A problem of Ulam on planar graphs
- The age of a relational structure
- Bounded graphs
- Universal elements and the complexity of certain classes of infinite graphs
- Distanced graphs
- A proof of the bounded graph conjecture
- Homogeneity conditions in graphs
- Universal graphs with forbidden subgraphs and algebraic closure
- The complexity of a class of infinite graphs
- Nonexistence of universal graphs without some trees
- A probabilistic view of Datalog parallelization
- On random relational structures
- On the order of countable graphs
- Homogeneous Cayley objects
- Problems on discrete metric spaces
- Fraïssé limits in comma categories
- Copies of the random graph
- Universal graphs and functions on \(\omega_1\)
- Homogeneous actions on the random graph
- Lower bounds for superpatterns and universal sequences
- Geometric random graphs on circles
- Ample simplicial complexes
- Graph theory -- a survey on the occasion of the Abel Prize for László Lovász
- On \(n\)-saturated closed graphs
- Supertrees
- On existentially complete triangle-free graphs
- Universal arrays
- The Rado simplicial complex
- Forbidden substructures and combinatorial dichotomies: WQO and universality
- Universal graphs omitting finitely many finite graphs
- The distinguishing index of infinite graphs
- Bipartite graph embeddings, Riemann surfaces and Galois groups
- Exchangeable graph-valued Feller processes
- Dynamics of a generic Brownian motion: Recursive aspects
- Large superuniversal metric spaces
- Notes on combinatorial set theory
- Undirecting membership in models of anti-foundation
- Universality vs genericity and \(C_4\)-free graphs
- Infinite quantum permutations
- The poset of all copies of the random graph has the 2-localization property
- Universal functions
- Many symmetrically indivisible structures
- Uncountable graphs and invariant measures on the set of universal countable graphs
- Universality of group embeddability
- Universal graphs at the successor of a singular cardinal
- Universality of random permutations
- Asymptotic quasi-completeness and ZFC
- Partitions and orientations of the Rado graph
- Universal \(H\)-colourable graphs
- Asymptotic enumeration and a 0-1 law for m-clique free graphs
- On automorphisms of the countable p.e.c. graph
- Fraïssé sequences: category-theoretic approach to universal homogeneous structures
- Adjacency labeling schemes and induced-universal graphs
- Optimal induced universal graphs for bounded-degree graphs
- Induced universal hypergraphs
- Infinite Paley graphs
- Triply existentially complete triangle-free graphs
- Fraïssé limits for relational metric structures
- Weak Fraïssé categories
- Indivisible sets and well-founded orientations of the Rado graph
- Which subsets of an infinite random graph look random?
- On the resolution of the sensitivity conjecture
- SMT-based verification of data-aware processes: a model-theoretic approach
- Asymptotically optimal induced universal graphs
- Generating infinite random graphs
- Almost every domain is universal
- Neostability in countable homogeneous metric spaces
- A rigid Urysohn-like metric space
- Some remarks on universal graphs
- A note on classes of subgraphs of locally finite graphs
- Polish topologies on endomorphism monoids of relational structures
- Universal graphs for the topological minor relation
- Factorizing the Rado graph and infinite complete graphs
- Bowtie‐free graphs and generic automorphisms
- The lattice of definability: origins, recent developments, and further directions
- Two-step nilpotent extensions are not anabelian
- Universal end-compactifications of locally finite graphs
- Posets of copies of countable ultrahomogeneous tournaments
- Universal geometric graphs
- Large simplicial complexes: universality, randomness, and ampleness
- On graph classes with minor-universal elements
- A note on universal graphs for spanning trees
- Higher dimensional universal functions from lower dimensional ones
- Finite-model theory -- A personal perspective
- Universal families of arcs and curves on surfaces
- Randomized communication and implicit graph representations
- Unique subgraphs are rare
- How to get the random graph with non-uniform probabilities?
- Universality for graphs of bounded degeneracy
- Universal graphs between a strong limit singular and its power
- Universal graph series, chromatic functions, and their index theory
- Tight bounds for hypercube minor-universality
- Universal dynamical system for brain modeling
This page was built for publication: Universal graphs and universal functions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5514308)
