A Generalization of Erdős' Matching Conjecture

Electronic Journal Of Combinatorics

Christos Pelekis¹ 

关键词: Erdős matching conjecture;    Hypergraphs;    Complete intersection theorem;   

DOI  :  

学科分类：离散数学和组合数学

来源: Electronic Journal Of Combinatorics

【 摘 要 】

Let $\mathcal{H}=(V,\mathcal{E})$ be an $r$-uniform hypergraph on $n$ vertices and fix a positive integer $k$ such that $1\le k\le r$. A $k$-matching of $\mathcal{H}$ is a collection of edges $\mathcal{M}\subset \mathcal{E}$ such that every subset of $V$

【 授权许可】

Others