On families with bounded matching number

DOI10.2140/moscow.2023.12.197zbMath1522.05480OpenAlexW4386988911MaRDI QIDQ6079296

Jian Wang, Peter Frankl

Publication date: 29 September 2023

Published in: Moscow Journal of Combinatorics and Number Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.2140/moscow.2023.12.197

zbMATH Keywords

matching numbermatchingsset systemsthreshold families

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Extremal set theory (05D05) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Cites Work

• Unnamed Item
• Unnamed Item
• Improved bounds for Erdős' matching conjecture
• On the maximum number of edges in a hypergraph with given matching number
• Families of sets with no matchings of sizes 3 and 4
• On families of sets without \(k\) pairwise disjoint members
• Refuting conjectures in extremal combinatorics via linear programming
• Extremal set theory for the binomial norm
• Two problems on matchings in set families -- in the footsteps of Erdős and Kleitman
• On the Maximum Number of Edges in a Triple System Not Containing a Disjoint Family of a Given Size
• On maximal paths and circuits of graphs
• INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS
• On the size of graphs with complete-factors
• Extremal Problems for Finite Sets
• Families with no s pairwise disjoint sets
• Maximal number of subsets of a finite set No k of which are pairwise disjoint

This page was built for publication: On families with bounded matching number