Statements (24)
| Predicate | Object |
|---|---|
| gptkbp:instanceOf |
graph
|
| gptkbp:application |
combinatorics
topological methods in combinatorics |
| gptkbp:category |
regular graph
distance-regular graph symmetric graph vertex-transitive graph |
| gptkbp:chromaticNumber |
n-2k+2
|
| gptkbp:definedIn |
graph whose vertices correspond to k-element subsets of an n-element set, with edges between disjoint subsets
|
| gptkbp:edgeCondition |
vertices are adjacent if corresponding subsets are disjoint
|
| gptkbp:field |
graph theory
|
| gptkbp:hasSpecialCase |
Petersen graph is K(5,2)
|
| https://www.w3.org/2000/01/rdf-schema#label |
Kneser graph
|
| gptkbp:introducedIn |
1955
|
| gptkbp:isSubgraphOf |
gptkb:Johnson_graph
|
| gptkbp:namedAfter |
gptkb:Martin_Kneser
|
| gptkbp:notation |
K(n,k)
|
| gptkbp:relatedTo |
gptkb:Erdős–Ko–Rado_theorem
gptkb:Lovász's_proof_of_Kneser's_conjecture |
| gptkbp:vertices |
binomial(n,k)
|
| gptkbp:bfsParent |
gptkb:Adolf_Kneser
gptkb:Martin_Kneser gptkb:László_Lovász |
| gptkbp:bfsLayer |
5
|