Rado graph
In the mathematical field of graph theory, the Rado graph, Erdős–Rényi graph, or random graph is a countably infinite graph that can be constructed (with probability one) by choosing independently at random for each pair of its vertices whether to connect the vertices by an edge. The names of this graph honor Richard Rado, Paul Erdős, and Alfréd Rényi, mathematicians who studied it in the early 1960s; it appears even earlier in the work of Wilhelm Ackermann . The Rado graph can also be constructed non-randomly, by symmetrizing the membership relation of the hereditarily finite sets, by applying the BIT predicate to the binary representations of the natural numbers, or as an infinite Paley graph that has edges connecting pairs of prime numbers congruent to 1 mod 4 that are quadratic resid
Wikipage redirect
Asymmetric graphBIT predicateBack-and-forth methodCountable random graphFraïssé limitGallery of named graphsHenson graphHereditarily finite setHomogeneous graphList of first-order theoriesLogic of graphsOmega-categorical theoryRandom graphRichard RadoSaturated modelSchläfli graphSelf-complementary graphSymmetric graphThe Strange Logic of Random GraphsThe random graphUniversal graphVertex-transitive graph
Link from a Wikipage to another Wikipage
primaryTopic
Rado graph
In the mathematical field of graph theory, the Rado graph, Erdős–Rényi graph, or random graph is a countably infinite graph that can be constructed (with probability one) by choosing independently at random for each pair of its vertices whether to connect the vertices by an edge. The names of this graph honor Richard Rado, Paul Erdős, and Alfréd Rényi, mathematicians who studied it in the early 1960s; it appears even earlier in the work of Wilhelm Ackermann . The Rado graph can also be constructed non-randomly, by symmetrizing the membership relation of the hereditarily finite sets, by applying the BIT predicate to the binary representations of the natural numbers, or as an infinite Paley graph that has edges connecting pairs of prime numbers congruent to 1 mod 4 that are quadratic resid
has abstract
En mathématiques, et plus préc ...... s s'ils sont connectés ou non.
@fr
In the mathematical field of g ...... tegorical and complete theory.
@en
Граф Радо — единственный (с то ...... ый граф и граф Эрдёша — Реньи.
@ru
Граф Радо — єдиний (з точністю ...... ий граф і граф Ердеша — Реньї.
@uk
Link from a Wikipage to an external page
Wikipage page ID
page length (characters) of wiki page
Wikipage revision ID
1,025,557,718
Link from a Wikipage to another Wikipage
author1-link
Paul Erdős
@en
author2-link
Alfréd Rényi
@en
authorlink
Richard Rado
@en
Wilhelm Ackermann
@en
first
Alfréd
@en
Paul
@en
Richard
@en
Wilhelm
@en
last
Ackermann
@en
Erdős
@en
Rado
@en
Rényi
@en
wikiPageUsesTemplate
year
comment
En mathématiques, et plus préc ...... s s'ils sont connectés ou non.
@fr
In the mathematical field of g ...... mod 4 that are quadratic resid
@en
Граф Радо — единственный (с то ...... ый граф и граф Эрдёша — Реньи.
@ru
Граф Радо — єдиний (з точністю ...... ий граф і граф Ердеша — Реньї.
@uk
label
Graphe de Rado
@fr
Rado graph
@en
Граф Радо
@ru
Граф Радо
@uk
라도 그래프
@ko