On families with bounded matching number
From MaRDI portal
Publication:6079296
Recommendations
- Upper Bounds on Matching Families in <formula formulatype="inline"> <tex Notation="TeX">$\BBZ_{pq}^{n}$</tex></formula>
- Families with no matchings of size s
- On non-trivial families without a perfect matching
- Two problems on matchings in set families -- in the footsteps of Erdős and Kleitman
- Bounds on pairs of families with restricted intersections
- A note on divisibility of the number of matchings of a family of graphs
- On families in finite lattices
- On a bound of cover-free families
- On the maximum size of subfamilies of labeled set with given matching number
- On the representing number of intersecting families
Cites work
- Extremal problems for finite sets
- Extremal set theory for the binomial norm
- Families of sets with no matchings of sizes 3 and 4
- Families with no s pairwise disjoint sets
- scientific article; zbMATH DE number 4029608 (Why is no real title available?)
- scientific article; zbMATH DE number 3221072 (Why is no real title available?)
- Improved bounds for Erdős' matching conjecture
- INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS
- Maximal number of subsets of a finite set No k of which are pairwise disjoint
- On families of sets without \(k\) pairwise disjoint members
- On maximal paths and circuits of graphs
- On the maximum number of edges in a hypergraph with given matching number
- On the maximum number of edges in a triple system not containing a disjoint family of a given size
- On the size of graphs with complete-factors
- Refuting conjectures in extremal combinatorics via linear programming
- Two problems on matchings in set families -- in the footsteps of Erdős and Kleitman
Cited in
(12)- The maximum number of disjoint pairs in a family of subsets
- Families of sets with no matchings of sizes 3 and 4
- Families with no matchings of size s
- A counterexample to Aharoni's strongly maximal matching conjecture
- On non-trivial families without a perfect matching
- The Erdős matching conjecture and concentration inequalities
- Belyi pairs and fried families
- On the maximum size of subfamilies of labeled set with given matching number
- Disjoint edges in separated hypergraphs
- Families with no perfect matchings
- Upper Bounds on Matching Families in <formula formulatype="inline"> <tex Notation="TeX">$\BBZ_{pq}^{n}$</tex></formula>
- Families with restricted matching number and multiply covered shadows
This page was built for publication: On families with bounded matching number
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6079296)
