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.
Wikipage redirect
Abstract simplicial complexBalanced hypergraphBipartite hypergraphD-interval hypergraphFractional matching in hypergraphsHall-type theorems for hypergraphsHelly familyHypergraphHypergraph matchingKnaster–Kuratowski–Mazurkiewicz lemmaKőnig's theorem (graph theory)List of PPAD-complete problemsMatching (graph theory)Matching in hypergraphsMax-min item allocationMaximum cardinality matchingPerfect matching in high-degree hypergraphsRainbow-independent setRyser's conjectureSperner's lemmaTruncated projective planeVertex cover in hypergraphsWidth of a hypergraphZoltán Füredi
Link from a Wikipage to another Wikipage
primaryTopic
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.
has abstract
In graph theory, a matching in ...... notion of matching in a graph.
@en
Wikipage page ID
63,030,703
page length (characters) of wiki page
Wikipage revision ID
1,020,402,704
Link from a Wikipage to another Wikipage
wikiPageUsesTemplate
comment
In graph theory, a matching in ...... notion of matching in a graph.
@en
label
Matching in hypergraphs
@en