Quality:

Matching in hypergraphs - set of hyperedges where every pair is disjoint. Article “Matching in hypergraphs” in English Wikipedia has 39.6 points for quality (as of July 1, 2025).
The article contains 20 references and 12 sections.
Since the creation of article “Matching in hypergraphs”, its content was written by 15 registered users of English Wikipedia and edited by 15 registered Wikipedia users in all languages.
The article is cited 29 times in English Wikipedia and cited 29 times in all languages.
The highest Authors Interest rank from 2001:
- Local (English): #87327 in September 2020
- Global: #316773 in September 2020
The highest popularity rank from 2008:
- Local (English): #1339513 in November 2021
- Global: #2321618 in June 2025
There is 1 language version for this article in the WikiRank database (of the considered 55 Wikipedia language editions).
The quality and popularity assessment was based on Wikipédia dumps from July 1, 2025 (including revision history and pageviews for previous years).