Live briefing
Everything about Matching in hypergraphs
Set of hyperedges where every pair is disjoint
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. Wikipedia →
🧭 Start here: a 6-step reading path
- Read the overview: Matching in hypergraphsA 5-minute orientation
- Skim a recent paper: Matching of Given Sizes in HypergraphsInfluential work since 2022
- Pick up a classic book: Linguistic structure predictionThe most-reprinted book on the subject
- Read the landmark paper: Perfect Matchings in Hypergraphs and the Erdös Matching ConjectureCited 20 times
- Go sideways: Ryser's conjectureA closely related topic
- Go sideways: Vertex cover in hypergraphsA closely related topic
📖 Definitions
No dictionary entry for this exact phrase.
🏆 Landmark papers (most cited)
Perfect Matchings in Hypergraphs and the Erdös Matching Conjecture
COMPUTATIONAL COMPLEXITY OF THE PERFECT MATCHING PROBLEM IN HYPERGRAPHS WITH SUBCRITICAL DENSITY
A stochastic matching model on hypergraphs
On the rainbow matching conjecture for 3-uniform hypergraphs
Matching and domination numbers in r-uniform hypergraphs
The Turán number of Berge-matching in hypergraphs
Extremal hypergraphs for matching number and domination number
Resilient Hypergraphs with Fixed Matching Number
🆕 Influential since 2022
Matching of Given Sizes in Hypergraphs
Perfect Matching and Hamilton Tight Cycle Decomposition of Complete $n$-Balanced $r$-Partite $k$-Uniform Hypergraphs
The perfect matching and tight Hamilton cycle decomposition of complete n-balanced mk-partite k-uniform hypergraphs
A Degree Sequence Strengthening of the Vertex Degree Threshold for a Perfect Matching in 3-Uniform Hypergraphs
Matching orderable and separable hypergraphs
📚 Books worth reading
Linguistic structure predictionNoah A. Smith · 2011
Advances in Computing, Communication, and ControlSrija Unnikrishnan · 2013
Ranked by number of editions on Open Library, a rough measure of how lasting a book is.
🔗 Related topics
- Ryser's conjecture Unsolved problem in mathematics Conjecture: τ(H)≤(r−1)⋅ν(H) More unsolved problems in mathematics In graph theory, Ryser's conjecture is a conjecture relating…
- Vertex cover in hypergraphs In graph theory, a vertex cover in a hypergraph is a set of vertices, such that every hyperedge of the hypergraph contains at least one vertex of that…
- Hall-type theorems for hypergraphs In the mathematical field of graph theory, Hall-type theorems for hypergraphs are several generalizations of Hall's marriage theorem from graphs to hypergraphs…
- Bipartite hypergraph In graph theory, the term bipartite hypergraph describes several related classes of hypergraphs, all of which are natural generalizations of a bipartite…
- Balanced hypergraph In graph theory, a balanced hypergraph is a hypergraph that has several properties analogous to that of a bipartite graph. Balanced hypergraphs were introduced…
- Truncated projective plane In geometry, a truncated projective plane (TPP), also known as a dual affine plane, is a special kind of a hypergraph or geometric configuration that is…
- Fractional matching In graph theory, a fractional matching is a generalization of a matching in which, intuitively, each vertex may be broken into fractions that are matched…
- Rainbow matching In the mathematical discipline of graph theory, a rainbow matching in an edge-colored graph is a matching in which all the edges have distinct colors.…