Classification of Maximum Hittings by Large Families
Graphs and Combinatorics(2019)
摘要
For integers r and n , where n is sufficiently large, and for every set X ⊆ [n] we determine the maximal left-compressed intersecting families 𝒜⊆( [ [n]; r ]) which achieve maximum hitting with X (i.e. have the most members which intersect X ). This answers a question of Barber, who extended previous results by Borg to characterise those sets X for which maximum hitting is achieved by the star.
更多查看译文
关键词
Set systems, Intersecting families, Compressions
AI 理解论文
溯源树
样例
![](https://originalfileserver.aminer.cn/sys/aminer/pubs/mrt_preview.jpeg)
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要