Statements (53)
| Predicate | Object |
|---|---|
| gptkbp:instanceOf |
gptkb:mathematical_concept
|
| gptkbp:application |
information retrieval
bioinformatics clustering parallel computing data mining social network analysis VLSI design constraint satisfaction problems database schema design |
| gptkbp:defines |
A hypergraph is a generalization of a graph in which an edge can join any number of vertices.
|
| gptkbp:field |
gptkb:mathematics
discrete mathematics graph theory |
| gptkbp:generalizes |
graph
|
| gptkbp:hasComponent |
vertex
hyperedge |
| gptkbp:hasInvariant |
chromatic number
covering number independence number matching number transversal number |
| gptkbp:hasProperty |
gptkb:list
uniformity incidence matrix |
| gptkbp:hasType |
bipartite hypergraph
directed hypergraph k-uniform hypergraph regular hypergraph weighted hypergraph |
| https://www.w3.org/2000/01/rdf-schema#label |
hypergraph
|
| gptkbp:introduced |
gptkb:C._Berge
|
| gptkbp:introducedIn |
1960s
|
| gptkbp:relatedTo |
gptkb:clique
edge coloring vertex coloring incidence structure dual hypergraph matroid set system transversal |
| gptkbp:studiedIn |
gptkb:Ramsey_theory
gptkb:complexity_theory algorithm design extremal combinatorics probabilistic combinatorics |
| gptkbp:usedIn |
gptkb:machine_learning
computer science combinatorics network analysis database theory |
| gptkbp:bfsParent |
gptkb:Ramsey's_theorem_for_hypergraphs
|
| gptkbp:bfsLayer |
6
|