The Random Graph Revisited

  • Cameron P
N/ACitations
Citations of this article
14Readers
Mendeley users who have this article in their library.
Get full text

Abstract

The random graph, or Rado’s graph (the unique countable homo- geneous graph) has made an appearance in many parts of mathematics since its first occurrences in the early 1960s. In this paper I will discuss some old and new results on this remarkable structure.

Cite

CITATION STYLE

APA

Cameron, P. J. (2001). The Random Graph Revisited. In European Congress of Mathematics (pp. 267–274). Birkhäuser Basel. https://doi.org/10.1007/978-3-0348-8268-2_15

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free