{"title":"关于非空交叉相交族的说明","authors":"Menglong Zhang, Tao Feng","doi":"10.1016/j.ejc.2024.103968","DOIUrl":null,"url":null,"abstract":"<div><p>The families <span><math><mrow><msub><mrow><mi>F</mi></mrow><mrow><mn>1</mn></mrow></msub><mo>⊆</mo><mfenced><mrow><mfrac><mrow><mrow><mo>[</mo><mi>n</mi><mo>]</mo></mrow></mrow><mrow><msub><mrow><mi>k</mi></mrow><mrow><mn>1</mn></mrow></msub></mrow></mfrac></mrow></mfenced><mo>,</mo><msub><mrow><mi>F</mi></mrow><mrow><mn>2</mn></mrow></msub><mo>⊆</mo><mfenced><mrow><mfrac><mrow><mrow><mo>[</mo><mi>n</mi><mo>]</mo></mrow></mrow><mrow><msub><mrow><mi>k</mi></mrow><mrow><mn>2</mn></mrow></msub></mrow></mfrac></mrow></mfenced><mo>,</mo><mo>…</mo><mo>,</mo><msub><mrow><mi>F</mi></mrow><mrow><mi>r</mi></mrow></msub><mo>⊆</mo><mfenced><mrow><mfrac><mrow><mrow><mo>[</mo><mi>n</mi><mo>]</mo></mrow></mrow><mrow><msub><mrow><mi>k</mi></mrow><mrow><mi>r</mi></mrow></msub></mrow></mfrac></mrow></mfenced></mrow></math></span> are said to be cross-intersecting if <span><math><mrow><mrow><mo>|</mo><msub><mrow><mi>F</mi></mrow><mrow><mi>i</mi></mrow></msub><mo>∩</mo><msub><mrow><mi>F</mi></mrow><mrow><mi>j</mi></mrow></msub><mo>|</mo></mrow><mo>⩾</mo><mn>1</mn></mrow></math></span> for any <span><math><mrow><mn>1</mn><mo>⩽</mo><mi>i</mi><mo><</mo><mi>j</mi><mo>⩽</mo><mi>r</mi></mrow></math></span> and <span><math><mrow><msub><mrow><mi>F</mi></mrow><mrow><mi>i</mi></mrow></msub><mo>∈</mo><msub><mrow><mi>F</mi></mrow><mrow><mi>i</mi></mrow></msub></mrow></math></span>, <span><math><mrow><msub><mrow><mi>F</mi></mrow><mrow><mi>j</mi></mrow></msub><mo>∈</mo><msub><mrow><mi>F</mi></mrow><mrow><mi>j</mi></mrow></msub></mrow></math></span>. Cross-intersecting families <span><math><mrow><msub><mrow><mi>F</mi></mrow><mrow><mn>1</mn></mrow></msub><mo>,</mo><msub><mrow><mi>F</mi></mrow><mrow><mn>2</mn></mrow></msub><mo>,</mo><mo>…</mo><mo>,</mo><msub><mrow><mi>F</mi></mrow><mrow><mi>r</mi></mrow></msub></mrow></math></span> are said to be <em>non-empty</em> if <span><math><mrow><msub><mrow><mi>F</mi></mrow><mrow><mi>i</mi></mrow></msub><mo>≠</mo><mo>0̸</mo></mrow></math></span> for any <span><math><mrow><mn>1</mn><mo>⩽</mo><mi>i</mi><mo>⩽</mo><mi>r</mi></mrow></math></span>. This paper shows that if <span><math><mrow><msub><mrow><mi>F</mi></mrow><mrow><mn>1</mn></mrow></msub><mo>⊆</mo><mfenced><mrow><mfrac><mrow><mrow><mo>[</mo><mi>n</mi><mo>]</mo></mrow></mrow><mrow><msub><mrow><mi>k</mi></mrow><mrow><mn>1</mn></mrow></msub></mrow></mfrac></mrow></mfenced><mo>,</mo><msub><mrow><mi>F</mi></mrow><mrow><mn>2</mn></mrow></msub><mo>⊆</mo><mfenced><mrow><mfrac><mrow><mrow><mo>[</mo><mi>n</mi><mo>]</mo></mrow></mrow><mrow><msub><mrow><mi>k</mi></mrow><mrow><mn>2</mn></mrow></msub></mrow></mfrac></mrow></mfenced><mo>,</mo><mo>…</mo><mo>,</mo><msub><mrow><mi>F</mi></mrow><mrow><mi>r</mi></mrow></msub><mo>⊆</mo><mfenced><mrow><mfrac><mrow><mrow><mo>[</mo><mi>n</mi><mo>]</mo></mrow></mrow><mrow><msub><mrow><mi>k</mi></mrow><mrow><mi>r</mi></mrow></msub></mrow></mfrac></mrow></mfenced></mrow></math></span> are non-empty cross-intersecting families with <span><math><mrow><msub><mrow><mi>k</mi></mrow><mrow><mn>1</mn></mrow></msub><mo>⩾</mo><msub><mrow><mi>k</mi></mrow><mrow><mn>2</mn></mrow></msub><mo>⩾</mo><mo>⋯</mo><mo>⩾</mo><msub><mrow><mi>k</mi></mrow><mrow><mi>r</mi></mrow></msub></mrow></math></span> and <span><math><mrow><mi>n</mi><mo>⩾</mo><msub><mrow><mi>k</mi></mrow><mrow><mn>1</mn></mrow></msub><mo>+</mo><msub><mrow><mi>k</mi></mrow><mrow><mn>2</mn></mrow></msub></mrow></math></span>, then <span><math><mrow><msubsup><mrow><mo>∑</mo></mrow><mrow><mi>i</mi><mo>=</mo><mn>1</mn></mrow><mrow><mi>r</mi></mrow></msubsup><mrow><mo>|</mo><msub><mrow><mi>F</mi></mrow><mrow><mi>i</mi></mrow></msub><mo>|</mo></mrow><mo>⩽</mo><mo>max</mo><mrow><mo>{</mo><mfenced><mrow><mfrac><mrow><mi>n</mi></mrow><mrow><msub><mrow><mi>k</mi></mrow><mrow><mn>1</mn></mrow></msub></mrow></mfrac></mrow></mfenced><mo>−</mo><mfenced><mrow><mfrac><mrow><mi>n</mi><mo>−</mo><msub><mrow><mi>k</mi></mrow><mrow><mi>r</mi></mrow></msub></mrow><mrow><msub><mrow><mi>k</mi></mrow><mrow><mn>1</mn></mrow></msub></mrow></mfrac></mrow></mfenced><mo>+</mo><msubsup><mrow><mo>∑</mo></mrow><mrow><mi>i</mi><mo>=</mo><mn>2</mn></mrow><mrow><mi>r</mi></mrow></msubsup><mfenced><mrow><mfrac><mrow><mi>n</mi><mo>−</mo><msub><mrow><mi>k</mi></mrow><mrow><mi>r</mi></mrow></msub></mrow><mrow><msub><mrow><mi>k</mi></mrow><mrow><mi>i</mi></mrow></msub><mo>−</mo><msub><mrow><mi>k</mi></mrow><mrow><mi>r</mi></mrow></msub></mrow></mfrac></mrow></mfenced><mo>,</mo><mspace></mspace><msubsup><mrow><mo>∑</mo></mrow><mrow><mi>i</mi><mo>=</mo><mn>1</mn></mrow><mrow><mi>r</mi></mrow></msubsup><mfenced><mrow><mfrac><mrow><mi>n</mi><mo>−</mo><mn>1</mn></mrow><mrow><msub><mrow><mi>k</mi></mrow><mrow><mi>i</mi></mrow></msub><mo>−</mo><mn>1</mn></mrow></mfrac></mrow></mfenced><mo>}</mo></mrow></mrow></math></span>. This solves a problem posed by Shi, Frankl and Qian recently. The extremal families attaining the upper bounds are also characterized.</p></div>","PeriodicalId":50490,"journal":{"name":"European Journal of Combinatorics","volume":null,"pages":null},"PeriodicalIF":1.0000,"publicationDate":"2024-04-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"A note on non-empty cross-intersecting families\",\"authors\":\"Menglong Zhang, Tao Feng\",\"doi\":\"10.1016/j.ejc.2024.103968\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<div><p>The families <span><math><mrow><msub><mrow><mi>F</mi></mrow><mrow><mn>1</mn></mrow></msub><mo>⊆</mo><mfenced><mrow><mfrac><mrow><mrow><mo>[</mo><mi>n</mi><mo>]</mo></mrow></mrow><mrow><msub><mrow><mi>k</mi></mrow><mrow><mn>1</mn></mrow></msub></mrow></mfrac></mrow></mfenced><mo>,</mo><msub><mrow><mi>F</mi></mrow><mrow><mn>2</mn></mrow></msub><mo>⊆</mo><mfenced><mrow><mfrac><mrow><mrow><mo>[</mo><mi>n</mi><mo>]</mo></mrow></mrow><mrow><msub><mrow><mi>k</mi></mrow><mrow><mn>2</mn></mrow></msub></mrow></mfrac></mrow></mfenced><mo>,</mo><mo>…</mo><mo>,</mo><msub><mrow><mi>F</mi></mrow><mrow><mi>r</mi></mrow></msub><mo>⊆</mo><mfenced><mrow><mfrac><mrow><mrow><mo>[</mo><mi>n</mi><mo>]</mo></mrow></mrow><mrow><msub><mrow><mi>k</mi></mrow><mrow><mi>r</mi></mrow></msub></mrow></mfrac></mrow></mfenced></mrow></math></span> are said to be cross-intersecting if <span><math><mrow><mrow><mo>|</mo><msub><mrow><mi>F</mi></mrow><mrow><mi>i</mi></mrow></msub><mo>∩</mo><msub><mrow><mi>F</mi></mrow><mrow><mi>j</mi></mrow></msub><mo>|</mo></mrow><mo>⩾</mo><mn>1</mn></mrow></math></span> for any <span><math><mrow><mn>1</mn><mo>⩽</mo><mi>i</mi><mo><</mo><mi>j</mi><mo>⩽</mo><mi>r</mi></mrow></math></span> and <span><math><mrow><msub><mrow><mi>F</mi></mrow><mrow><mi>i</mi></mrow></msub><mo>∈</mo><msub><mrow><mi>F</mi></mrow><mrow><mi>i</mi></mrow></msub></mrow></math></span>, <span><math><mrow><msub><mrow><mi>F</mi></mrow><mrow><mi>j</mi></mrow></msub><mo>∈</mo><msub><mrow><mi>F</mi></mrow><mrow><mi>j</mi></mrow></msub></mrow></math></span>. Cross-intersecting families <span><math><mrow><msub><mrow><mi>F</mi></mrow><mrow><mn>1</mn></mrow></msub><mo>,</mo><msub><mrow><mi>F</mi></mrow><mrow><mn>2</mn></mrow></msub><mo>,</mo><mo>…</mo><mo>,</mo><msub><mrow><mi>F</mi></mrow><mrow><mi>r</mi></mrow></msub></mrow></math></span> are said to be <em>non-empty</em> if <span><math><mrow><msub><mrow><mi>F</mi></mrow><mrow><mi>i</mi></mrow></msub><mo>≠</mo><mo>0̸</mo></mrow></math></span> for any <span><math><mrow><mn>1</mn><mo>⩽</mo><mi>i</mi><mo>⩽</mo><mi>r</mi></mrow></math></span>. This paper shows that if <span><math><mrow><msub><mrow><mi>F</mi></mrow><mrow><mn>1</mn></mrow></msub><mo>⊆</mo><mfenced><mrow><mfrac><mrow><mrow><mo>[</mo><mi>n</mi><mo>]</mo></mrow></mrow><mrow><msub><mrow><mi>k</mi></mrow><mrow><mn>1</mn></mrow></msub></mrow></mfrac></mrow></mfenced><mo>,</mo><msub><mrow><mi>F</mi></mrow><mrow><mn>2</mn></mrow></msub><mo>⊆</mo><mfenced><mrow><mfrac><mrow><mrow><mo>[</mo><mi>n</mi><mo>]</mo></mrow></mrow><mrow><msub><mrow><mi>k</mi></mrow><mrow><mn>2</mn></mrow></msub></mrow></mfrac></mrow></mfenced><mo>,</mo><mo>…</mo><mo>,</mo><msub><mrow><mi>F</mi></mrow><mrow><mi>r</mi></mrow></msub><mo>⊆</mo><mfenced><mrow><mfrac><mrow><mrow><mo>[</mo><mi>n</mi><mo>]</mo></mrow></mrow><mrow><msub><mrow><mi>k</mi></mrow><mrow><mi>r</mi></mrow></msub></mrow></mfrac></mrow></mfenced></mrow></math></span> are non-empty cross-intersecting families with <span><math><mrow><msub><mrow><mi>k</mi></mrow><mrow><mn>1</mn></mrow></msub><mo>⩾</mo><msub><mrow><mi>k</mi></mrow><mrow><mn>2</mn></mrow></msub><mo>⩾</mo><mo>⋯</mo><mo>⩾</mo><msub><mrow><mi>k</mi></mrow><mrow><mi>r</mi></mrow></msub></mrow></math></span> and <span><math><mrow><mi>n</mi><mo>⩾</mo><msub><mrow><mi>k</mi></mrow><mrow><mn>1</mn></mrow></msub><mo>+</mo><msub><mrow><mi>k</mi></mrow><mrow><mn>2</mn></mrow></msub></mrow></math></span>, then <span><math><mrow><msubsup><mrow><mo>∑</mo></mrow><mrow><mi>i</mi><mo>=</mo><mn>1</mn></mrow><mrow><mi>r</mi></mrow></msubsup><mrow><mo>|</mo><msub><mrow><mi>F</mi></mrow><mrow><mi>i</mi></mrow></msub><mo>|</mo></mrow><mo>⩽</mo><mo>max</mo><mrow><mo>{</mo><mfenced><mrow><mfrac><mrow><mi>n</mi></mrow><mrow><msub><mrow><mi>k</mi></mrow><mrow><mn>1</mn></mrow></msub></mrow></mfrac></mrow></mfenced><mo>−</mo><mfenced><mrow><mfrac><mrow><mi>n</mi><mo>−</mo><msub><mrow><mi>k</mi></mrow><mrow><mi>r</mi></mrow></msub></mrow><mrow><msub><mrow><mi>k</mi></mrow><mrow><mn>1</mn></mrow></msub></mrow></mfrac></mrow></mfenced><mo>+</mo><msubsup><mrow><mo>∑</mo></mrow><mrow><mi>i</mi><mo>=</mo><mn>2</mn></mrow><mrow><mi>r</mi></mrow></msubsup><mfenced><mrow><mfrac><mrow><mi>n</mi><mo>−</mo><msub><mrow><mi>k</mi></mrow><mrow><mi>r</mi></mrow></msub></mrow><mrow><msub><mrow><mi>k</mi></mrow><mrow><mi>i</mi></mrow></msub><mo>−</mo><msub><mrow><mi>k</mi></mrow><mrow><mi>r</mi></mrow></msub></mrow></mfrac></mrow></mfenced><mo>,</mo><mspace></mspace><msubsup><mrow><mo>∑</mo></mrow><mrow><mi>i</mi><mo>=</mo><mn>1</mn></mrow><mrow><mi>r</mi></mrow></msubsup><mfenced><mrow><mfrac><mrow><mi>n</mi><mo>−</mo><mn>1</mn></mrow><mrow><msub><mrow><mi>k</mi></mrow><mrow><mi>i</mi></mrow></msub><mo>−</mo><mn>1</mn></mrow></mfrac></mrow></mfenced><mo>}</mo></mrow></mrow></math></span>. This solves a problem posed by Shi, Frankl and Qian recently. The extremal families attaining the upper bounds are also characterized.</p></div>\",\"PeriodicalId\":50490,\"journal\":{\"name\":\"European Journal of Combinatorics\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":1.0000,\"publicationDate\":\"2024-04-08\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"European Journal of Combinatorics\",\"FirstCategoryId\":\"100\",\"ListUrlMain\":\"https://www.sciencedirect.com/science/article/pii/S0195669824000532\",\"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/S0195669824000532","RegionNum":3,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"MATHEMATICS","Score":null,"Total":0}
The families are said to be cross-intersecting if for any and , . Cross-intersecting families are said to be non-empty if for any . This paper shows that if are non-empty cross-intersecting families with and , then . This solves a problem posed by Shi, Frankl and Qian recently. The extremal families attaining the upper bounds are also characterized.
期刊介绍:
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.