Families with restricted matching number and multiply covered shadows

DOI10.1016/j.disc.2023.113831zbMath1530.05149MaRDI QIDQ6177434

Jie You, Peter Frankl, Baolong Shang, Jian Wang

Publication date: 17 January 2024

Published in: Discrete Mathematics (Search for Journal in Brave)

zbMATH Keywords

shadowmatchingextremal set theory

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Structural characterization of families of graphs (05C75)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Improved bounds for Erdős' matching conjecture
• On the maximum number of edges in a hypergraph with given matching number
• Maximizing the number of cliques in graphs with given matching number
• The Erdős matching conjecture and concentration inequalities
• Two problems on matchings in set families -- in the footsteps of Erdős and Kleitman
• The Size of a Hypergraph and its Matching Number
• On maximal paths and circuits of graphs
• INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS
• SETS OF INDEPENDENT EDGES OF A HYPERGRAPH
• An Intersection Theorem for a Collection of Families of Subsets of a Finite Set