On the sum of sizes of overlapping families

DOI10.1016/j.disc.2022.113027zbMath1495.05254arXiv2105.00481OpenAlexW3158713846MaRDI QIDQ2166287

Jian Wang, Peter Frankl

Publication date: 24 August 2022

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

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

zbMATH Keywords

hypergraph matchingrainbow matchingoverlapping families

Mathematics Subject Classification ID

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

Related Items (1)

Extremal Problem for Matchings and Rainbow Matchings on Direct Products

Cites Work

• Unnamed Item
• Improved bounds for Erdős' matching conjecture
• Erdős-Ko-Rado from Kruskal-Katona
• Old and new applications of Katona's circle
• A simple proof of the Erdős-Chao Ko-Rado theorem
• The Size of a Hypergraph and its Matching Number
• INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS
• On the size of graphs with complete-factors
• SETS OF INDEPENDENT EDGES OF A HYPERGRAPH
• An Intersection Theorem for a Collection of Families of Subsets of a Finite Set

This page was built for publication: On the sum of sizes of overlapping families