Turán graph
complete multipartite graph for partitions whose sizes are as equal as possible
Facts
3 properties- Subclass of
- undirected graph, complete multipartite graph, cograph, ultrahomogeneous graph[2][3][4][5]
- Studied by
- graph theory[6]
🏷️ Also known as
en Turan graph
en Turán graph
de Turán-Graph
es grafo de Turan
es grafo de Turán
fr graphe de Turan
fr graphe de Turán
hu Turán-gráf
id graf pesta cocktail
it grafo di Turán
ja トゥラーングラフ
pl Graf Turana
pl Graf Turána
ro graf Turán
ru граф Турана
vi Đồ thị Turán
zh Turán图
zh 图兰图
zh 圖蘭圖
zh-hant Turán圖
🔖 Identifiers · 4
- Freebase ID
- /m/025ssx7
- MathWorld ID
- TuranGraph
- Microsoft Academic ID (discontinued)
- 119109516
- Wolfram Language entity code
- Entity["GraphClass", "Turan"]
🔗 Connections
Subclass of 2
Subtypes 2
Created notable works 1
Examples 1
Maintained by WikiProject 1
Named after 1
Studied by 1
Press Enter · cited answer in seconds