z-logo
Premium
Random graph orders do not satisfy a 0–1 law
Author(s) -
Brightwell Graham
Publication year - 1995
Publication title -
random structures and algorithms
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 1.314
H-Index - 69
eISSN - 1098-2418
pISSN - 1042-9832
DOI - 10.1002/rsa.3240060211
Subject(s) - bounded function , combinatorics , mathematics , vertex (graph theory) , random graph , discrete mathematics , graph , transitive relation , transitive closure , limiting , random regular graph , 1 planar graph , line graph , mathematical analysis , mechanical engineering , engineering
The random graph order P n p is defined by taking a random graph G n p on vertex set [n], interpreting an edge between vertices i and j , with i

This content is not available in your region!

Continue researching here.

Having issues? You can contact us here
Accelerating Research

Address

John Eccles House
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom