Analogues of Katona's and Milner's theorems for two families

From MaRDI portal
Publication:2659239




Abstract: Let n>s>0 be integers, X an n-element set and mathscrA,mathscrBsubset2X two families. If |AcupB|les for all AinmathscrA,BinmathscrB, then mathscrA and mathscrB are called cross s-union. Assuming that neither mathscrA nor mathscrB is empty, we prove several best possible bounds. In particular, we show that |mathscrA|+|mathscrB|le1+sumlimits0leilesnchoosei. Supposing nge2s and mathscrA,mathscrB are antichains, we show that |mathscrA|+|mathscrB|lenchoose1+nchooses1 unless mathscrA=emptyset or mathscrB=emptyset. An analogous result for three families is established as well.









This page was built for publication: Analogues of Katona's and Milner's theorems for two families

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2659239)