Matching in hypergraphs
http://dbpedia.org/resource/Matching_in_hypergraphs
In graph theory, a matching in a hypergraph is a set of hyperedges, in which every two hyperedges are disjoint. It is an extension of the notion of matching in a graph.
rdf:langString
rdf:langString
Matching in hypergraphs
xsd:integer
63030703
xsd:integer
1114776161
rdf:langString
In graph theory, a matching in a hypergraph is a set of hyperedges, in which every two hyperedges are disjoint. It is an extension of the notion of matching in a graph.
xsd:nonNegativeInteger
19169