{"title":"波洛巴斯集对定理的变式","authors":"Gábor Hegedüs , Péter Frankl","doi":"10.1016/j.ejc.2024.103983","DOIUrl":null,"url":null,"abstract":"<div><p>Let <span><math><mi>X</mi></math></span> be an <span><math><mi>n</mi></math></span>-element set. A set-pair system <span><math><mrow><mi>P</mi><mo>=</mo><msub><mrow><mrow><mo>{</mo><mrow><mo>(</mo><msub><mrow><mi>A</mi></mrow><mrow><mi>i</mi></mrow></msub><mo>,</mo><msub><mrow><mi>B</mi></mrow><mrow><mi>i</mi></mrow></msub><mo>)</mo></mrow><mo>}</mo></mrow></mrow><mrow><mn>1</mn><mo>≤</mo><mi>i</mi><mo>≤</mo><mi>m</mi></mrow></msub></mrow></math></span> is a collection of pairs of disjoint subsets of <span><math><mi>X</mi></math></span>. It is called skew Bollobás system if <span><math><mrow><msub><mrow><mi>A</mi></mrow><mrow><mi>i</mi></mrow></msub><mo>∩</mo><msub><mrow><mi>B</mi></mrow><mrow><mi>j</mi></mrow></msub><mo>≠</mo><mo>0̸</mo></mrow></math></span> for all <span><math><mrow><mn>1</mn><mo>≤</mo><mi>i</mi><mo><</mo><mi>j</mi><mo>≤</mo><mi>m</mi></mrow></math></span>. The best possible inequality <span><math><mrow><munderover><mrow><mo>∑</mo></mrow><mrow><mi>i</mi><mo>=</mo><mn>1</mn></mrow><mrow><mi>m</mi></mrow></munderover><mfrac><mrow><mn>1</mn></mrow><mrow><mfenced><mfrac><mrow><mrow><mo>|</mo><msub><mrow><mi>A</mi></mrow><mrow><mi>i</mi></mrow></msub><mo>|</mo></mrow><mo>+</mo><mrow><mo>|</mo><msub><mrow><mi>B</mi></mrow><mrow><mi>i</mi></mrow></msub><mo>|</mo></mrow></mrow><mrow><mrow><mo>|</mo><msub><mrow><mi>A</mi></mrow><mrow><mi>i</mi></mrow></msub><mo>|</mo></mrow></mrow></mfrac></mfenced></mrow></mfrac><mo>≤</mo><mi>n</mi><mo>+</mo><mn>1</mn><mo>.</mo></mrow></math></span> is established along with some more results of similar flavor.</p></div>","PeriodicalId":50490,"journal":{"name":"European Journal of Combinatorics","volume":null,"pages":null},"PeriodicalIF":1.0000,"publicationDate":"2024-05-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.sciencedirect.com/science/article/pii/S0195669824000684/pdfft?md5=21ca6f2c126894c4d8c03cff15a181b3&pid=1-s2.0-S0195669824000684-main.pdf","citationCount":"0","resultStr":"{\"title\":\"Variations on the Bollobás set-pair theorem\",\"authors\":\"Gábor Hegedüs , Péter Frankl\",\"doi\":\"10.1016/j.ejc.2024.103983\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<div><p>Let <span><math><mi>X</mi></math></span> be an <span><math><mi>n</mi></math></span>-element set. A set-pair system <span><math><mrow><mi>P</mi><mo>=</mo><msub><mrow><mrow><mo>{</mo><mrow><mo>(</mo><msub><mrow><mi>A</mi></mrow><mrow><mi>i</mi></mrow></msub><mo>,</mo><msub><mrow><mi>B</mi></mrow><mrow><mi>i</mi></mrow></msub><mo>)</mo></mrow><mo>}</mo></mrow></mrow><mrow><mn>1</mn><mo>≤</mo><mi>i</mi><mo>≤</mo><mi>m</mi></mrow></msub></mrow></math></span> is a collection of pairs of disjoint subsets of <span><math><mi>X</mi></math></span>. It is called skew Bollobás system if <span><math><mrow><msub><mrow><mi>A</mi></mrow><mrow><mi>i</mi></mrow></msub><mo>∩</mo><msub><mrow><mi>B</mi></mrow><mrow><mi>j</mi></mrow></msub><mo>≠</mo><mo>0̸</mo></mrow></math></span> for all <span><math><mrow><mn>1</mn><mo>≤</mo><mi>i</mi><mo><</mo><mi>j</mi><mo>≤</mo><mi>m</mi></mrow></math></span>. The best possible inequality <span><math><mrow><munderover><mrow><mo>∑</mo></mrow><mrow><mi>i</mi><mo>=</mo><mn>1</mn></mrow><mrow><mi>m</mi></mrow></munderover><mfrac><mrow><mn>1</mn></mrow><mrow><mfenced><mfrac><mrow><mrow><mo>|</mo><msub><mrow><mi>A</mi></mrow><mrow><mi>i</mi></mrow></msub><mo>|</mo></mrow><mo>+</mo><mrow><mo>|</mo><msub><mrow><mi>B</mi></mrow><mrow><mi>i</mi></mrow></msub><mo>|</mo></mrow></mrow><mrow><mrow><mo>|</mo><msub><mrow><mi>A</mi></mrow><mrow><mi>i</mi></mrow></msub><mo>|</mo></mrow></mrow></mfrac></mfenced></mrow></mfrac><mo>≤</mo><mi>n</mi><mo>+</mo><mn>1</mn><mo>.</mo></mrow></math></span> is established along with some more results of similar flavor.</p></div>\",\"PeriodicalId\":50490,\"journal\":{\"name\":\"European Journal of Combinatorics\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":1.0000,\"publicationDate\":\"2024-05-09\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"https://www.sciencedirect.com/science/article/pii/S0195669824000684/pdfft?md5=21ca6f2c126894c4d8c03cff15a181b3&pid=1-s2.0-S0195669824000684-main.pdf\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"European Journal of Combinatorics\",\"FirstCategoryId\":\"100\",\"ListUrlMain\":\"https://www.sciencedirect.com/science/article/pii/S0195669824000684\",\"RegionNum\":3,\"RegionCategory\":\"数学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q1\",\"JCRName\":\"MATHEMATICS\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"European Journal of Combinatorics","FirstCategoryId":"100","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S0195669824000684","RegionNum":3,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"MATHEMATICS","Score":null,"Total":0}
引用次数: 0
摘要
设 X 是一个 n 元素集合。如果对于所有 1≤i<j≤m 的 Ai∩Bj≠0̸ ,则称其为偏斜波罗巴系统。最佳不等式 ∑i=1m1|Ai|+|Bi||Ai|≤n+1.
Let be an -element set. A set-pair system is a collection of pairs of disjoint subsets of . It is called skew Bollobás system if for all . The best possible inequality is established along with some more results of similar flavor.
期刊介绍:
The European Journal of Combinatorics is a high standard, international, bimonthly journal of pure mathematics, specializing in theories arising from combinatorial problems. The journal is primarily open to papers dealing with mathematical structures within combinatorics and/or establishing direct links between combinatorics and other branches of mathematics and the theories of computing. The journal includes full-length research papers on important topics.