1 paper
Lusheng Fang, Guorong Gao, An Chang
Let Mk denote a matching of size k. The classical Erdős matching conjecture asks for the maximum number of edges of an intersecting r-graph without Mk. The csae for k=2…