Statements (18)
| Predicate | Object |
|---|---|
| gptkbp:instanceOf |
gptkb:mathematical_concept
|
| gptkbp:alsoKnownAs |
k-uniform hypergraph
|
| gptkbp:application |
coding theory
computer science design theory |
| gptkbp:defines |
A hypergraph in which every edge connects the same number of vertices.
|
| gptkbp:field |
combinatorics
graph theory |
| gptkbp:generalizes |
simple graphs
|
| gptkbp:hasSpecialCase |
2-uniform hypergraph is a simple graph
|
| https://www.w3.org/2000/01/rdf-schema#label |
uniform hypergraphs
|
| gptkbp:parameter |
k (uniformity)
|
| gptkbp:property |
edges are k-element subsets of the vertex set
|
| gptkbp:relatedConcept |
hypergraph coloring
incidence matrix |
| gptkbp:studiedBy |
gptkb:Paul_Erdős
|
| gptkbp:bfsParent |
gptkb:Ramsey's_theorem_for_hypergraphs
|
| gptkbp:bfsLayer |
6
|