Multi-part cross-intersecting families

IF 0.6 3区 数学 Q3 MATHEMATICS
Yuanxiao Xi, Xiangliang Kong, Gennian Ge
{"title":"Multi-part cross-intersecting families","authors":"Yuanxiao Xi, Xiangliang Kong, Gennian Ge","doi":"10.1007/s10801-024-01301-6","DOIUrl":null,"url":null,"abstract":"<p>Let <span>\\({\\mathcal {A}}\\subseteq {[n]\\atopwithdelims ()a}\\)</span> and <span>\\({\\mathcal {B}}\\subseteq {[n]\\atopwithdelims ()b}\\)</span> be two families of subsets of [<i>n</i>], we say <span>\\({\\mathcal {A}}\\)</span> and <span>\\({\\mathcal {B}}\\)</span> are cross-intersecting if <span>\\(A\\cap B\\ne \\emptyset \\)</span> for all <span>\\(A\\in {\\mathcal {A}}\\)</span>, <span>\\(B\\in {\\mathcal {B}}\\)</span>. In this paper, we study cross-intersecting families in the multi-part setting. By characterizing the independent sets of vertex-transitive graphs and their direct products, we determine the sizes and structures of maximum-sized multi-part cross-intersecting families. This generalizes the results of Hilton’s (J Lond Math Soc 15(2):369–376, 1977) and Frankl–Tohushige’s (J Comb Theory Ser A 61(1):87–97, 1992) on cross-intersecting families in the single-part setting.</p>","PeriodicalId":14926,"journal":{"name":"Journal of Algebraic Combinatorics","volume":"35 1","pages":""},"PeriodicalIF":0.6000,"publicationDate":"2024-02-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Journal of Algebraic Combinatorics","FirstCategoryId":"100","ListUrlMain":"https://doi.org/10.1007/s10801-024-01301-6","RegionNum":3,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q3","JCRName":"MATHEMATICS","Score":null,"Total":0}
引用次数: 0

Abstract

Let \({\mathcal {A}}\subseteq {[n]\atopwithdelims ()a}\) and \({\mathcal {B}}\subseteq {[n]\atopwithdelims ()b}\) be two families of subsets of [n], we say \({\mathcal {A}}\) and \({\mathcal {B}}\) are cross-intersecting if \(A\cap B\ne \emptyset \) for all \(A\in {\mathcal {A}}\), \(B\in {\mathcal {B}}\). In this paper, we study cross-intersecting families in the multi-part setting. By characterizing the independent sets of vertex-transitive graphs and their direct products, we determine the sizes and structures of maximum-sized multi-part cross-intersecting families. This generalizes the results of Hilton’s (J Lond Math Soc 15(2):369–376, 1977) and Frankl–Tohushige’s (J Comb Theory Ser A 61(1):87–97, 1992) on cross-intersecting families in the single-part setting.

多部分交叉族
让({\mathcal {A}}subseteq {[n]\atopwithdelims()a}\)和({\mathcal {B}}subseteq {[n]\atopwithdelims()b}\)是[n]的两个子集族、如果对于所有的\(A in {\mathcal {A}}\),\(B in {\mathcal {B}}\),\(Acap Bne \emptyset \)都是交叉的,我们就说\({\mathcal {A}}\)和\({\mathcal {B}}\)是交叉的。在本文中,我们将研究多部分环境下的交叉相交族。通过描述顶点变换图的独立集及其直接乘积,我们确定了最大尺寸的多部分交叉族的大小和结构。这概括了希尔顿(J Lond Math Soc 15(2):369-376, 1977)和弗兰克尔-托胡希(Frankl-Tohushige)(J Comb Theory Ser A 61(1):87-97, 1992)关于单部分交叉族的结果。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
CiteScore
1.50
自引率
12.50%
发文量
94
审稿时长
6-12 weeks
期刊介绍: The Journal of Algebraic Combinatorics provides a single forum for papers on algebraic combinatorics which, at present, are distributed throughout a number of journals. Within the last decade or so, algebraic combinatorics has evolved into a mature, established and identifiable area of mathematics. Research contributions in the field are increasingly seen to have substantial links with other areas of mathematics. The journal publishes papers in which combinatorics and algebra interact in a significant and interesting fashion. This interaction might occur through the study of combinatorial structures using algebraic methods, or the application of combinatorial methods to algebraic problems.
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信