Kneser graph
graph representing disjointness between k-element subsets of an n-element set
Facts
4 properties- Named after
- Martin Kneser[1]
- Studied by
- graph theory[7]
- Time of discovery or invention
- 1955[6]
🏷️ Also known as
en Kneser graph
es grafo de Kneser
fa گراف نسر
fr graphe de Kneser
he גרף קנזר
hu Kneser-gráf
ja クネーザーグラフ
ru граф Кнезера
ru кнезеровский граф
uk граф Кнезера
uk кнезерів граф
uk кнезерівський граф
zh Kneser圖
zh 克內澤爾圖
🔖 Identifiers · 4
- Freebase ID
- /m/07_3cm
- MathWorld ID
- KneserGraph
- Microsoft Academic ID (discontinued)
- 51366580
- Wolfram Language entity code
- Entity["GraphClass", "Kneser"]
🔗 Connections
Subclass of 4
Subtypes 2
Maintained by WikiProject 1
Named after 1
Studied by 1
← FactGrid item ID 1
Press Enter · cited answer in seconds