Rado graph

Summary

Rado graph is an undirected graph^[1]. It draws 123 Wikipedia views per month (undirected_graph category, ranking #2 of 10).^[2]

Key Facts

• Rado graph's image is recorded as Rado graph.svg^[3].
• Rado graph's instance of is recorded as undirected graph^[4].
• Rado graph's instance of is recorded as symmetric graph^[5].
• Rado graph's instance of is recorded as infinite graph^[6].
• Rado graph's instance of is recorded as self-complementary graph^[7].
• Rado graph's instance of is recorded as ultrahomogeneous graph^[8].
• Richard Rado is named after Rado graph^[9].
• Paul Erdős is named after Rado graph^[10].
• Alfréd Rényi is named after Rado graph^[11].
• Rado graph's based on is recorded as set of non-negative integers^[12].
• Rado graph's Freebase ID is recorded as /m/026czmk^[13].
• Rado graph's studied by is recorded as graph theory^[14].
• Rado graph's Microsoft Academic ID is recorded as 77365371^[15].
• Rado graph's ScienceDirect topic ID is recorded as mathematics/renyi-random-graph^[16].

Why It Matters

Rado graph draws 123 Wikipedia views per month (undirected_graph category, ranking #2 of 10).^[2] It has Wikipedia articles in 6 language editions, a strong signal of global cultural recognition.^[17] It is known by 7 alternative names across languages and contexts.^[18]