{"version":"1.0","type":"link","title":"Matching in hypergraphs - Newikis","description":"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.","provider_name":"Newikis","provider_url":"https://newikis.com","cache_age":86400,"thumbnail_url":"https://thumb.wikimedia.org/wikipedia/commons/thumb/3/31/Hypergraph_matchings.svg/1280px-Hypergraph_matchings.svg.png","thumbnail_width":1280,"thumbnail_height":1401}