Families with no matchings of size \(s\)
type: Item
instance of: scholarly article
title: Families with no matchings of size \(s\)
zbMATH Open document ID: 1378.05201
author: Peter Frankl
author: Andrey B. Kupavskii
publication date: 2018-01-18T00:00:00Z
Mathematics Subject Classification ID: 05D05
Mathematics Subject Classification ID: 05D15
zbMATH DE Number: 6827214
zbMATH Keywords: set families
zbMATH Keywords: matchings
zbMATH Keywords: Erdős matching conjecture
zbMATH Keywords: forbidden subconfigurations
MaRDI profile type: Publication
full work available at URL: j.endm.2017.06.077
OpenAlex ID: W2744053296
cites work: SETS OF INDEPENDENT EDGES OF A HYPERGRAPH
cites work: Q5510578
cites work: On maximal paths and circuits of graphs
cites work: INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS
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: Families with no s pairwise disjoint sets
cites work: SOME INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS
cites work: Maximal number of subsets of a finite set No k of which are pairwise disjoint
cites work: On Erdős' extremal problem on matchings in hypergraphs
cites work: Anti-Ramsey number of matchings in hypergraphs
DOI: 10.1016/J.ENDM.2017.06.077
description: scientific article; zbMATH DE number 6827214