Statements (51)
| Predicate | Object |
|---|---|
| gptkbp:instanceOf |
gptkb:mathematical_concept
graph theory object |
| gptkbp:definedIn |
a generalization of a graph in which an edge can join any number of vertices
|
| gptkbp:generalizes |
graph
|
| gptkbp:hasApplication |
gptkb:machine_learning
combinatorial optimization network analysis database theory VLSI design |
| gptkbp:hasDual |
dual hypergraph
|
| gptkbp:hasEdgeSet |
set of hyperedges
|
| gptkbp:hasProperty |
gptkb:list
gptkb:university gptkb:clique simplicity path connectivity edge coloring duality chromatic number cycle matching planarity vertex coloring uniformity line graph incidence structure independence number transversal intersection graph covering acyclicity colorability partitionability |
| gptkbp:hasSpecialCase |
graph
directed hypergraph k-uniform hypergraph weighted hypergraph simple hypergraph |
| gptkbp:hasVertexSet |
set of vertices
|
| https://www.w3.org/2000/01/rdf-schema#label |
Hypergraph
|
| gptkbp:hyperedge |
subset of the vertex set
|
| gptkbp:represents |
bipartite graph
incidence matrix |
| gptkbp:studiedBy |
gptkb:Claude_Berge
|
| gptkbp:studiedIn |
hypergraph theory
|
| gptkbp:usedIn |
computer science
discrete mathematics combinatorics |
| gptkbp:bfsParent |
gptkb:Hitting_Set
|
| gptkbp:bfsLayer |
7
|