波洛巴斯集对定理的变式

IF 1 3区 数学 Q1 MATHEMATICS European Journal of Combinatorics Pub Date : 2024-05-09 DOI:10.1016/j.ejc.2024.103983
Gábor Hegedüs , Péter Frankl
{"title":"波洛巴斯集对定理的变式","authors":"Gábor Hegedüs ,&nbsp;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>&lt;</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 ,&nbsp;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>&lt;</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.
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
Variations on the Bollobás set-pair theorem

Let X be an n-element set. A set-pair system P={(Ai,Bi)}1im is a collection of pairs of disjoint subsets of X. It is called skew Bollobás system if AiBj for all 1i<jm. The best possible inequality i=1m1|Ai|+|Bi||Ai|n+1. is established along with some more results of similar flavor.

求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
CiteScore
2.10
自引率
10.00%
发文量
124
审稿时长
4-8 weeks
期刊介绍: 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.
期刊最新文献
A combinatorial PROP for bialgebras Signed Mahonian polynomials on derangements in classical Weyl groups Degree conditions for Ramsey goodness of paths Bounded unique representation bases for the integers On the faces of unigraphic 3-polytopes
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1