Acta Mathematica Hungarica Математика (общая)
Intersecting families with large shadow degree
Аннотация
Abstract A $$k$$ k -uniform family $$\mathcal{F}$$ F is called intersecting if $$F\cap F'\neq \emptyset$$ F ∩ F ′ ≠ ∅ for all $$F,F'\in \mathcal{F}$$ F , F ′ ∈ F . The shadow family $$\partial \mathcal{F}$$ ∂ F is the family of $$(k-1)$$ ( k - 1 ) -element sets that are contained in some members of $$\mathcal{F}$$ F . The shadow degree (or minimum positive co-degree) of $$\mathcal{F}$$ F is defined as the maximum integer $$r$$ r such that every $$E\in \partial \mathcal{F}$$ E ∈ ∂ F is contained in at least $$r$$ r members of $$\mathcal{F}$$ F . Balogh, Lemons and Palmer [1] determined the maximum size of an intersecting $$k$$ k -uniform family with shadow degree at least $$r$$ r for $$n\geq n_0(k,r)$$ n ≥ n 0 ( k , r ) , where $$n_0(k,r)$$ n 0 ( k , r ) is doubly exponential in $$k$$ k for $$4\leq r\leq k$$ 4 ≤ r ≤ k . In the present paper, we present a short proof of this result for $$n\geq 2\frac{(r+1)^r}{\binom{2r-1}{r}}k\binom{2k}{k-1}$$ n ≥ 2 ( r + 1 ) r 2 r - 1 r k 2 k k - 1 and $$4\leq r\leq k$$ 4 ≤ r ≤ k .