Some results around the Erdős matching conjecture

MaRDI QIDQ6621203

Andrey B. Kupavskii, Peter Frankl

Publication date: 18 October 2024

Published in: Acta Mathematica Universitatis Comenianae. New Series (Search for Journal in Brave)

zbMATH Keywords

matchings in hypergraphsErdős matching conjecture

Mathematics Subject Classification ID

Hypergraphs (05C65) Extremal set theory (05D05)

Cites Work

• Title not available (Why is that?)
• Improved bounds for Erdős' matching conjecture
• Large matchings in uniform hypergraphs and the conjectures of Erdős and samuels
• On the maximum number of edges in a hypergraph with given matching number
• The complete intersection theorem for systems of finite sets
• Families of sets with no matchings of sizes 3 and 4
• Proof of the Erdős matching conjecture in a new range
• Families with no matchings of size \(s\)
• New inequalities for families without \(k\) pairwise disjoint members
• Two problems on matchings in set families -- in the footsteps of Erdős and Kleitman
• On Erdős' extremal problem on matchings in hypergraphs
• On the maximum number of edges in a triple system not containing a disjoint family of a given size
• 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
• Partition‐free families of sets
• Families with no s pairwise disjoint sets
• SOME INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS
• Maximal number of subsets of a finite set No k of which are pairwise disjoint

This page was built for publication: Some results around the Erdős matching conjecture

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