The random graph
From MaRDI portal
Abstract: ErdH{o}s and R'{e}nyi showed the paradoxical result that there is a unique (and highly symmetric) countably infinite random graph. This graph, and its automorphism group, form the subject of the present survey.
Recommendations
Cited in
(69)- The capture time of a graph
- Homogeneous and ultrahomogeneous linear spaces
- Homomorphisms and amalgamation
- Generalized pigeonhole properties of graphs and oriented graphs
- Universal partial order represented by means of oriented trees and other simple graphs
- A note on orientations of the infinite random graph
- Copies of the random graph
- Minimal functions on the random graph
- Homogeneous actions on the random graph
- Geometric random graphs on circles
- Ample simplicial complexes
- On existentially complete triangle-free graphs
- The Rado simplicial complex
- Two Fraïssé-style theorems for homomorphism-homogeneous relational structures
- Further results on existentially closed graphs arising from block designs
- Random Oxford graphs
- Ramsey type properties of ideals
- Permutation monoids and MB-homogeneity for graphs and relational structures
- Geometric random graphs and Rado sets in sequence spaces
- On an adjacency property of almost all tournaments
- Some isometry groups of the Urysohn space
- Random generations of the countable random graph
- Reconstruction of a coloring from its homogeneous sets
- Isomorphisms between random graphs
- The poset of all copies of the random graph has the 2-localization property
- Many Facets of Dualities
- scientific article; zbMATH DE number 3150484 (Why is no real title available?)
- Spanning subgraphs of graphs partitioned into two isomorphic pieces
- On representing words in the automorphism group of the random graph
- Graphs with the \(n\)-e.c. adjacency property constructed from resolvable designs
- scientific article; zbMATH DE number 3904630 (Why is no real title available?)
- scientific article; zbMATH DE number 4029600 (Why is no real title available?)
- Properties of the automorphism group and a probabilistic construction of a class of countable labeled structures
- A Pigeonhole Property for Relational Structures
- Tension continuous maps -- their structure and applications
- scientific article; zbMATH DE number 1019391 (Why is no real title available?)
- scientific article; zbMATH DE number 1944718 (Why is no real title available?)
- Retractions of reversible structures
- Random orderings and unique ergodicity of automorphism groups
- Maximal chains of isomorphic subgraphs of the Rado graph
- scientific article; zbMATH DE number 857026 (Why is no real title available?)
- Revolutionaries and Spies on Random Graphs
- Infinite Paley graphs
- A preferential attachment process approaching the Rado graph
- Preferential attachment processes approaching the Rado multigraph
- Semantic limits of dense combinatorial objects
- scientific article; zbMATH DE number 3893250 (Why is no real title available?)
- Automorphism groups of countable algebraically closed graphs and endomorphisms of the random graph
- On an adjacency property of almost all graphs
- Evolving Shelah‐Spencer graphs
- Private simultaneous messages based on quadratic residues
- Factorizing the Rado graph and infinite complete graphs
- Expectation-maximizing network reconstruction and most applicable network types based on binary time series data
- Forcing with copies of the Rado and Henson graphs
- A random walk on the Rado graph
- Remarks on homomorphism-homogeneous lattices and semilattices
- Infinite random geometric graphs
- Every group-embeddable monoid arises as the bimorphism monoid of some graph
- Homomorphism-homogeneity classes of countable L-colored graphs
- Large simplicial complexes: universality, randomness, and ampleness
- Big Ramsey degrees using parameter spaces
- Characterizations of Urysohn universal ultrametric spaces
- The externally definable Ramsey property and fixed points on type spaces
- Reversibility of extreme relational structures
- Finite presentation of homogeneous graphs, posets and Ramsey classes
- Metric spaces are Ramsey
- A finite presentation of the rational Urysohn space
- All countable monoids embed into the monoid of the infinite random graph
- Posets, homomorphisms and homogeneity
This page was built for publication: The random graph
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5689022)
