{"title":"关于克莱特曼一个结果的推广","authors":"Ryan R. Martin, Balázs Patkós","doi":"arxiv-2409.08694","DOIUrl":null,"url":null,"abstract":"A classical result of Kleitman determines the maximum number $f(n,s)$ of\nsubsets in a family $\\mathcal{F}\\subseteq 2^{[n]}$ of sets that do not contain\ndistinct sets $F_1,F_2,\\dots,F_s$ that are pairwise disjoint in the case\n$n\\equiv 0,-1$ (mod $s$). Katona and Nagy determined the maximum size of a\nfamily of subsets of an $n$-element set that does not contain\n$A_1,A_2,\\dots,A_t,B_1,B_2,\\dots,B_t$ with $\\bigcup_{i=1}^t A_i$ and\n$\\bigcup_{i=1}^t B_i$ being disjoint. In this paper, we consider the problem of\nfinding the maximum number $vex(n,K_{s\\times t})$ in a family\n$\\mathcal{F}\\subseteq 2^{[n]}$ without sets\n$F^1_1,\\dots,F^1_t,\\dots,F^s_1,\\dots,F^s_t$ such that\n$G_j=\\bigcup_{i=1}^tF^j_i$ $j=1,2,\\dots,s$ are pairwise disjoint. We determine\nthe asymptotics of $2^n-vex(n,K_{s\\times t})$ if $n\\equiv -1$ (mod $s$) for all\n$t$, and if $n\\equiv 0$ (mod $s$), $t\\ge 3$ and show that in this latter case\nthe asymptotics of the $t=2$ subcase is different from both the $t=1$ and $t\\ge\n3$ subcases.","PeriodicalId":501407,"journal":{"name":"arXiv - MATH - Combinatorics","volume":"30 1","pages":""},"PeriodicalIF":0.0000,"publicationDate":"2024-09-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"On a generalization of a result of Kleitman\",\"authors\":\"Ryan R. Martin, Balázs Patkós\",\"doi\":\"arxiv-2409.08694\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"A classical result of Kleitman determines the maximum number $f(n,s)$ of\\nsubsets in a family $\\\\mathcal{F}\\\\subseteq 2^{[n]}$ of sets that do not contain\\ndistinct sets $F_1,F_2,\\\\dots,F_s$ that are pairwise disjoint in the case\\n$n\\\\equiv 0,-1$ (mod $s$). Katona and Nagy determined the maximum size of a\\nfamily of subsets of an $n$-element set that does not contain\\n$A_1,A_2,\\\\dots,A_t,B_1,B_2,\\\\dots,B_t$ with $\\\\bigcup_{i=1}^t A_i$ and\\n$\\\\bigcup_{i=1}^t B_i$ being disjoint. In this paper, we consider the problem of\\nfinding the maximum number $vex(n,K_{s\\\\times t})$ in a family\\n$\\\\mathcal{F}\\\\subseteq 2^{[n]}$ without sets\\n$F^1_1,\\\\dots,F^1_t,\\\\dots,F^s_1,\\\\dots,F^s_t$ such that\\n$G_j=\\\\bigcup_{i=1}^tF^j_i$ $j=1,2,\\\\dots,s$ are pairwise disjoint. We determine\\nthe asymptotics of $2^n-vex(n,K_{s\\\\times t})$ if $n\\\\equiv -1$ (mod $s$) for all\\n$t$, and if $n\\\\equiv 0$ (mod $s$), $t\\\\ge 3$ and show that in this latter case\\nthe asymptotics of the $t=2$ subcase is different from both the $t=1$ and $t\\\\ge\\n3$ subcases.\",\"PeriodicalId\":501407,\"journal\":{\"name\":\"arXiv - MATH - Combinatorics\",\"volume\":\"30 1\",\"pages\":\"\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2024-09-13\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"arXiv - MATH - Combinatorics\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/arxiv-2409.08694\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"arXiv - MATH - Combinatorics","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/arxiv-2409.08694","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
A classical result of Kleitman determines the maximum number $f(n,s)$ of
subsets in a family $\mathcal{F}\subseteq 2^{[n]}$ of sets that do not contain
distinct sets $F_1,F_2,\dots,F_s$ that are pairwise disjoint in the case
$n\equiv 0,-1$ (mod $s$). Katona and Nagy determined the maximum size of a
family of subsets of an $n$-element set that does not contain
$A_1,A_2,\dots,A_t,B_1,B_2,\dots,B_t$ with $\bigcup_{i=1}^t A_i$ and
$\bigcup_{i=1}^t B_i$ being disjoint. In this paper, we consider the problem of
finding the maximum number $vex(n,K_{s\times t})$ in a family
$\mathcal{F}\subseteq 2^{[n]}$ without sets
$F^1_1,\dots,F^1_t,\dots,F^s_1,\dots,F^s_t$ such that
$G_j=\bigcup_{i=1}^tF^j_i$ $j=1,2,\dots,s$ are pairwise disjoint. We determine
the asymptotics of $2^n-vex(n,K_{s\times t})$ if $n\equiv -1$ (mod $s$) for all
$t$, and if $n\equiv 0$ (mod $s$), $t\ge 3$ and show that in this latter case
the asymptotics of the $t=2$ subcase is different from both the $t=1$ and $t\ge
3$ subcases.