On the maximum diversity of hypergraphs with fixed matching number

DOI10.1016/J.DAM.2024.12.012MaRDI QIDQ7028910zbMATH OpenFDO

Authors Peter Frankl, Jian Wang

Publication date 11 February 2025

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

Full work available at URL https://doi.org/10.1016/J.DAM.2024.12.012

zbMATH Keywords

diversitymatching numbershifted family

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) Extremal set theory (05D05)

Cites work

• A product version of the Hilton-Milner-Frankl theorem
• Antichains of fixed diameter
• Diversity
• Diversity of uniform intersecting families
• scientific article; zbMATH DE number 3616474 (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
• Improved bounds on the maximum diversity of intersecting families
• INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS
• Maximum degree and diversity in intersecting hypergraphs
• On maximal intersecting families of finite sets
• On maximal paths and circuits of graphs
• On the maximum number of edges in a hypergraph with given matching number
• On the sum of sizes of overlapping families
• Pseudo sunflowers
• Resilient hypergraphs with fixed matching number
• SETS OF INDEPENDENT EDGES OF A HYPERGRAPH
• Shadows and shifting
• The Erdős matching conjecture and concentration inequalities
• The size of a hypergraph and its matching number
• The unbalance of set systems

This page was built for publication: On the maximum diversity of hypergraphs with fixed matching number

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7028910)