2018
DOI: 10.37236/7420
|View full text |Cite
|
Sign up to set email alerts
|

A Generalization of Erdős' Matching Conjecture

Abstract: Let H = (V, E) be an r-uniform hypergraph on n vertices and fix a positive integer k such that 1 ≤ k ≤ r. A k-matching of H is a collection of edges M ⊂ E such that every subset of V whose cardinality equals k is contained in at most one element of M. The k-matching number of H is the maximum cardinality of a k-matching. A well-known problem, posed by Erdős, asks for the maximum number of edges in an r-uniform hypergraph under constraints on its 1-matching number. In this article we investigate the more genera… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...

Citation Types

0
0
0

Publication Types

Select...

Relationship

0
0

Authors

Journals

citations
Cited by 0 publications
references
References 10 publications
0
0
0
Order By: Relevance

No citations

Set email alert for when this publication receives citations?