On non-trivial families without a perfect matching
type: Item
instance of: scholarly article
title: On non-trivial families without a perfect matching
zbMATH Open document ID: 1428.05244
published in: European Journal of Combinatorics
publication date: 2019-11-28T00:00:00Z
Mathematics Subject Classification ID: 05C70
Mathematics Subject Classification ID: 05C35
zbMATH DE Number: 7138274
author: Peter Frankl
MaRDI profile type: Publication
full work available at URL: j.ejc.2019.103044
OpenAlex ID: W2982636504
cites work: SETS OF INDEPENDENT EDGES OF A HYPERGRAPH
cites work: Q5510578
cites work: Q3284375
cites work: INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS
cites work: Q3770569
cites work: Improved bounds for Erdős' matching conjecture
cites work: On the maximum number of edges in a hypergraph with given matching number
cites work: Proof of the Erdős matching conjecture in a new range
cites work: The Erdős matching conjecture and concentration inequalities
cites work: Two problems on matchings in set families -- in the footsteps of Erdős and Kleitman
cites work: On matchings in hypergraphs
cites work: SOME INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS
cites work: The size of a hypergraph and its matching number
cites work: Maximal number of subsets of a finite set No k of which are pairwise disjoint
DOI: 10.1016/J.EJC.2019.103044
description: scientific article; zbMATH DE number 7138274