The Random Graph

@inproceedings{Cameron2013TheRG,
  title={The Random Graph},
  author={Peter J. Cameron},
  booktitle={The Mathematics of Paul Erdős II},
  year={2013}
}
  • P. Cameron
  • Published in
    The Mathematics of Paul Erdős…
    31 January 2013
  • Computer Science, Mathematics
Erdős and Renyi 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. 
Partition properties on countable bipartite graphs
We classify all countably infinite (on both sides) bipartite graphs G having a naturally defined version of the pigeonhole principle. 2010 Mathematics Subject Classification: 05C63; 03E02
Infinite Paley graphs
Infinite analogues of the Paley graphs are constructed, based on uncountably many infinite but locally finite fields. Weil's estimate for character sums shows that they are all isomorphic to the
Extra pearls in graph theory
This is a supplement for "Pearls in graph theory" -- a textbook written by Nora Hartsfield and Gerhard Ringel. Probabilistic method, Deletion-contraction formulas, Matrix theorem, Graph-polynomials,
Properties of the automorphism group and a probabilistic construction of a class of countable labeled structures
TLDR
This work provides a probabilistic construction of countably infinite ultrahomogeneous structures that generalize edge-colored graphs and gives fairly general criteria for the automorphism group of such structures to have the small index property and strong uncountable cofinality, thus generalizing some results of Solecki, Rosendal, and several other authors.
A note on the relation between two properties of random graphs
The $t$-e.c. and pseudo-random property are typical properties of random graphs. In this note, we study the gap between them which has not been studied well. As a main result, we give the first
Bipartite graph embeddings, Riemann surfaces and Galois groups
  • G. Jones
  • Computer Science, Mathematics
    Discret. Math.
  • 2015
This is a survey of two related research topics, in each of which surface embeddings of bipartite graphs provide a bridge between two separate areas of mathematics: in the first case these are
Automorphism groups of countable algebraically closed graphs and endomorphisms of the random graph
Abstract We establish links between countable algebraically closed graphs and the endomorphisms of the countable universal graph R. As a consequence we show that, for any countable graph Γ, there are
Maximal chains of isomorphic subgraphs of the Rado graph
The partial order 〈E(R)∪{∅},⊂〉, where E(R) is the set of isomorphic subgraphs of the Rado graph R, is investigated. The order types of maximal chains in this poset are characterized as the order
Ramsey type properties of ideals
TLDR
It is shown that no tall F σ ideal is Ramsey, while there is a tall co-analytic Ramsey ideal.
Graph Searching and Related Problems
TLDR
A survey of the major results of graph searching problems, focusing on algorithmic, structural, and probabilistic aspects of the field.
...
1
2
3
4
5
...

References

SHOWING 1-10 OF 85 REFERENCES
The random graph has the strong small index property
  • P. Cameron
  • Computer Science, Mathematics
    Discret. Math.
  • 2005
TLDR
It is shown that the countable random graph has the small index property and a general theorem about permutation groups is deduced and the automorphism group of the random graph is not isomorphic to the Automorphism Group of any other countable homogeneous graph or digraph.
A Theorem on Reconstruction of Random Graphs
In this paper we prove that given a finite collection of finite graphs, and the subsets of vertices of a random graph G that induce those graphs, it is almost always possible to uniquely reconstruct
A Problem of Ulam on Planar Graphs
  • J. Pach
  • Computer Science, Mathematics
    Eur. J. Comb.
  • 1981
The following problem was raised by S. M. Ulam: Does there exist a countable planar graph Go such that every countable planar graph is isomorphic to a subgraph of G 0 ? We answer this question in the
Overgroups of the Automorphism Group of the Rado Graph
We are interested in overgroups of the automorphism group of the Rado graph. One class of such overgroups is completely understood; this is the class of reducts. In this article we tie recent work on
A New Strongly Minimal Set
  • E. Hrushovski
  • Mathematics, Computer Science
    Ann. Pure Appl. Log.
  • 1993
TLDR
A new class of ℵ 1 categorical structures is constructed, disproving Zilber's conjecture, and some of their properties are studied.
Countable homogeneous partially ordered sets
It is shown that there are only countably many countable homogeneous partially ordered sets, thereby affirming a conjecture of Henson [2]. A classification of these partially ordered sets is given.
Reducts of Random Hypergraphs
  • Simon Thomas
  • Mathematics, Computer Science
    Ann. Pure Appl. Log.
  • 1996
TLDR
It is shown that there exist only finitely many closed permutation groups G such that AUt(rk ) < G < &vn( rk) and each of the associated reducts of rk is homogeneous with respect to a finite relational language.
Random Structures and Zero-One Laws
Random structures (such as the classical random graphs of Erdős and Renyi) are playing an increasingly large role in the theory of computing, as well as in discrete mathematics. The surprising and
The Small Index Property for ω‐Stable (ω‐Categorical Structures and for the Random Graph
We give a criterion involving existence of many generic sequences of automorphisms for a countable structure to have the small index property. We use it to show that (i) any a>-stable co-categorical
Some isometry groups of the Urysohn space
TLDR
Various isometry groups of the Urysohn space are constructed, including abelian groups which act transitively, and free groups which are dense in the full isometry group.
...
1
2
3
4
5
...