|
gptkbp:instanceOf
|
gptkb:mathematical_concept
graph
random graph
ultrahomogeneous graph
universal graph
|
|
gptkbp:alsoKnownAs
|
gptkb:Erdős–Rényi_graph
random graph
|
|
gptkbp:automorphismGroup
|
large
|
|
gptkbp:builtBy
|
gptkb:Erdős–Rényi_process
back-and-forth method
|
|
gptkbp:firstDescribed
|
gptkb:Richard_Rado
1964
|
|
gptkbp:hasChromaticNumber
|
infinite
|
|
gptkbp:hasCliqueNumber
|
infinite
|
|
gptkbp:hasConnection
|
true
|
|
gptkbp:hasEdgeDensity
|
1/2
|
|
gptkbp:hasEdgeProbability
|
1/2
|
|
gptkbp:hasIndependenceNumber
|
infinite
|
|
gptkbp:hasProperty
|
any isomorphism between finite induced subgraphs extends to automorphism
every finite or countable graph embeds into it
|
|
gptkbp:hasVertexSet
|
countable set
|
|
https://www.w3.org/2000/01/rdf-schema#label
|
Rado graph
|
|
gptkbp:isCountable
|
true
|
|
gptkbp:isEdgeTransitive
|
true
|
|
gptkbp:isFinite
|
true
|
|
gptkbp:isHomogeneous
|
true
|
|
gptkbp:isLocallyFinite
|
false
|
|
gptkbp:isSelfComplementary
|
true
|
|
gptkbp:isUndirected
|
true
|
|
gptkbp:isUniqueUpToIsomorphism
|
true
|
|
gptkbp:isUniversal
|
true
|
|
gptkbp:isVertexTransitive
|
true
|
|
gptkbp:namedAfter
|
gptkb:Richard_Rado
|
|
gptkbp:publishedIn
|
Richard Rado, 'Universal graphs and universal functions', Acta Arithmetica, 1964
|
|
gptkbp:usedIn
|
gptkb:logic
model theory
combinatorics
graph theory
|
|
gptkbp:bfsParent
|
gptkb:Richard_Rado
|
|
gptkbp:bfsLayer
|
6
|