Let be a non-negative integer and \mbox{\cal P}=\{(A_i,B_i)\}_{1\leq i\leq m} be a set-pair family satisfying for . \mbox{\cal P} is called strong Bollobás -system, if for all . Füredi conjectured the following nice generalization of Bollobás’ Theorem: Let be a non-negative integer. Let \mbox{\cal P}=\{(A_i,B_i)\}_{1\leq i\leq m} be a strong Bollobás -system. Then We confirmed the following special case of Füredi’s conjecture along with some more results of similar flavor. Let be a non-negative integer. Let \mbox{\cal P}=\{(A_i,B_i)\}_{1\leq i\leq m} denote a strong Bollobás -system. Define and for each . Assume that there exists a positive integer such that for each . Then

生成讲解博客的中文版本

生成AI智能校验的中文版本