On matchings in hypergraphs
From MaRDI portal
Summary: We show that if the largest matching in a \(k\)-uniform hypergraph \(G\) on \(n\) vertices has precisely \(s\) edges, and \(n>2k^2s/\log k\), then \(H\) has at most \(\binom{n}{k} - \binom{n-s}{k}\) edges and this upper bound is achieved only for hypergraphs in which the set of edges consists of all \(k\)-subsets which intersect a given set of \(s\) vertices.
Recommendations
Cited in
(63)- Matchings in infinite graphs
- Extensions of Gallai's graph covering theorems for uniform hypergraphs
- Proof of the Erdős matching conjecture in a new range
- Extremal hypergraphs for matching number and domination number
- Resilient hypergraphs with fixed matching number
- On the random version of the Erdős matching conjecture
- A generalization of Erdős' matching conjecture
- On non-trivial families without a perfect matching
- Rainbow matchings for 3-uniform hypergraphs
- On the rainbow matching conjecture for 3-uniform hypergraphs
- Matching orderable and separable hypergraphs
- Size and structure of large \((s,t)\)-union intersecting families
- On the size of shadow-added intersecting families
- On the maximum size of subfamilies of labeled set with given matching number
- Mixed matchings in graphs
- Two problems on matchings in set families -- in the footsteps of Erdős and Kleitman
- Existence of a maximum balanced matching in the hypercube
- On the bandwidth of the Kneser graph
- Degree versions of the Erdős-Ko-Rado theorem and Erdős hypergraph matching conjecture
- Matching and domination numbers in \(r\)-uniform hypergraphs
- Hypergraph Turán numbers of linear cycles
- On Erdős' extremal problem on matchings in hypergraphs
- Linear trees in uniform hypergraphs
- On the maximum number of edges in hypergraphs with fixed matching and clique number
- A better bound on the size of rainbow matchings
- On matchings in graphs
- The size of a hypergraph and its matching number
- Matching critical intersection hypergraphs
- Santa claus meets hypergraph matchings
- Santa Claus Meets Hypergraph Matchings
- scientific article; zbMATH DE number 5763200 (Why is no real title available?)
- Matchings in Graphs Variations of the Problem
- The Complexity of Perfect Matching Problems on Dense Hypergraphs
- scientific article; zbMATH DE number 3957168 (Why is no real title available?)
- Improved bounds for Erdős' matching conjecture
- On vertex independence number of uniform hypergraphs
- On the matching number and the independence number of a random induced subhypergraph of a hypergraph
- Disjoint perfect matchings in 3‐uniform hypergraphs
- On Rainbow Matchings for Hypergraphs
- A stochastic matching model on hypergraphs
- Matching of given sizes in hypergraphs
- A stability result on matchings in 3-uniform hypergraphs
- Rainbow perfect matchings for 4-uniform hypergraphs
- On the maximum number of edges in a hypergraph with given matching number
- Matching criticality in intersecting hypergraphs
- scientific article; zbMATH DE number 6297805 (Why is no real title available?)
- Matchings in hypergraphs of large minimum degree
- A geometric theory for hypergraph matching
- Anti-Ramsey Number of Matchings in 3-Uniform Hypergraphs
- Some remarks on hypergraph matching and the Füredi–Kahn–Seymour conjecture
- Rainbow Turán numbers of matchings and forests of hyperstars in uniform hypergraphs
- On the matching number of \(k\)-uniform connected hypergraphs with maximum degree
- Monochromatic matchings in the shadow graph of almost complete hypergraphs
- Rainbow matchings in properly-colored hypergraphs
- A stability result for almost perfect matchings
- Some stability results for linear forests in hypergraphs
- Extremal G-free induced subgraphs of Kneser graphs
- A partial edge-density version of the Corrádi-Hajnal theorem in hypergraphs
- Linear dependencies, polynomial factors in the Duke-Erdős forbidden sunflower problem
- Invitation to intersection problems for finite sets
- The asymptotic induced matching number of hypergraphs: balanced binary strings
- The clique complex and hypergraph matching
- Intersection theorems for multisets
This page was built for publication: On matchings in hypergraphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q456292)
