On the maximum number of edges in hypergraphs with fixed matching and clique number

DOI10.1016/j.ejc.2022.103589zbMath1497.05122arXiv2012.15142OpenAlexW3116454305WikidataQ114184721 ScholiaQ114184721MaRDI QIDQ2674562

Jian Wang, Erica L. L. Liu, Peter Frankl

Publication date: 14 September 2022

Published in: European Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2012.15142

zbMATH Keywords

matching numberHilton-Milner stability theorem

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Hypergraphs (05C65) Enumeration in graph theory (05C30)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Improved bounds for Erdős' matching conjecture
• Intersecting \(k\)-uniform families containing all the \(k\)-subsets of a given set
• On the maximum number of edges in a hypergraph with given matching number
• A size-sensitive inequality for cross-intersecting families
• The exact bound in the Erdős-Ko-Rado theorem
• Proof of the Erdős matching conjecture in a new range
• Erdős-Ko-Rado theorem for a restricted universe
• A simple proof of the Erdős-Chao Ko-Rado theorem
• An Erdös-Ko-Rado theorem for direct products
• The Size of a Hypergraph and its Matching Number
• On maximal paths and circuits of graphs
• INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS
• On the size of graphs with complete-factors
• THE ERDÖS–KO–RADO THEOREM WITH VALENCY CONDITIONS
• SETS OF INDEPENDENT EDGES OF A HYPERGRAPH
• SOME INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS