Universal graphs and universal functions

DOI10.4064/aa-9-4-331-340zbMath0139.17303OpenAlexW1605337124WikidataQ56504569 ScholiaQ56504569MaRDI QIDQ5514308

Richard Rado

Publication date: 1964

Published in: Acta Arithmetica (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/207488

zbMATH Keywords

topology

Related Items

Exchangeable graph-valued Feller processes, Universal graphs at the successor of a singular cardinal, The poset of all copies of the random graph has the 2-localization property, Asymptotic enumeration and a 0-1 law for $m$-clique free graphs, Graph theory -- a survey on the occasion of the Abel Prize for László Lovász, Universal functions, On \(n\)-saturated closed graphs, Fraïssé limits in comma categories, Adjacency Labeling Schemes and Induced-Universal Graphs, Simplicial decompositions of graphs: A survey of applications, Some universal graphs, Universal \(H\)-colourable graphs, Chromatically optimal rigid graphs, Undirecting membership in models of anti-foundation, On automorphisms of the countable p.e.c. graph, Nonexistence of universal graphs without some trees, Supertrees, On existentially complete triangle-free graphs, The isometry group of the Urysohn space as a Lévy group, Many symmetrically indivisible structures, A probabilistic view of Datalog parallelization, Universality vs genericity and \(C_4\)-free graphs, A note on classes of subgraphs of locally finite graphs, Fraïssé sequences: category-theoretic approach to universal homogeneous structures, Polish topologies on endomorphism monoids of relational structures, On random relational structures, Universal graphs for the topological minor relation, Factorizing the Rado graph and infinite complete graphs, Bowtie‐free graphs and generic automorphisms, Indivisible sets and well‐founded orientations of the Rado graph, Which subsets of an infinite random graph look random?, The lattice of definability: origins, recent developments, and further directions, Weak Fraisse categories, Infinite quantum permutations, On the order of countable graphs, Two-step nilpotent extensions are not anabelian, Universal end-compactifications of locally finite graphs, A problem of Ulam on planar graphs, On the resolution of the sensitivity conjecture, Optimal induced universal graphs for bounded-degree graphs, SMT-based verification of data-aware processes: a model-theoretic approach, Induced Universal Hypergraphs, A theorem of Hrushovski-Solecki-Vershik applied to uniform and coarse embeddings of the Urysohn metric space, Universality of random permutations, Universal arrays, Asymptotic Quasi-completeness and ZFC, The Rado simplicial complex, The age of a relational structure, Bounded graphs, Universal elements and the complexity of certain classes of infinite graphs, Distanced graphs, Asymptotically optimal induced universal graphs, Finite-model theory -- A personal perspective, Neostability in countable homogeneous metric spaces, Dynamics of a generic Brownian motion: Recursive aspects, Some remarks on universal graphs, A proof of the bounded graph conjecture, Constructing labeling schemes through universal matrices, On graphs isomorphic to their neighbour and non-neighbour sets, Copies of the random graph, Forbidden substructures and combinatorial dichotomies: WQO and universality, Uncountable graphs and invariant measures on the set of universal countable graphs, Universal graphs and functions on \(\omega_1\), Homogeneity conditions in graphs, Homogeneous actions on the random graph, Lower bounds for superpatterns and universal sequences, Infinite Paley graphs, Generating Infinite Random Graphs, Triply Existentially Complete Triangle‐Free Graphs, Large superuniversal metric spaces, Notes on combinatorial set theory, Geometric random graphs on circles, Universal graphs with forbidden subgraphs and algebraic closure, A proof of the rooted tree alternative conjecture, Universal graphs omitting finitely many finite graphs, Homogeneous Cayley objects, Problems on discrete metric spaces, Partitions and orientations of the Rado graph, The distinguishing index of infinite graphs, Universality of group embeddability, FRAÏSSÉ LIMITS FOR RELATIONAL METRIC STRUCTURES, 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, Almost Every Domain is Universal, Bipartite graph embeddings, Riemann surfaces and Galois groups, On universal graphs with forbidden topological subgraphs, Ample simplicial complexes, The complexity of a class of infinite graphs, Club guessing and the universal models, Ramsey theory for countable binary homogeneous structures, A rigid Urysohn-like metric space