Papers
Topics
Authors
Recent
Assistant
AI Research Assistant
Well-researched responses based on relevant abstracts and paper content.
Custom Instructions Pro
Preferences or requirements that you'd like Emergent Mind to consider when generating responses.
Gemini 2.5 Flash
Gemini 2.5 Flash 70 tok/s
Gemini 2.5 Pro 48 tok/s Pro
GPT-5 Medium 27 tok/s Pro
GPT-5 High 24 tok/s Pro
GPT-4o 75 tok/s Pro
Kimi K2 175 tok/s Pro
GPT OSS 120B 447 tok/s Pro
Claude Sonnet 4 36 tok/s Pro
2000 character limit reached

On cross-2-intersecting families (2503.15971v1)

Published 20 Mar 2025 in math.CO

Abstract: Two families $\mathcal A\subseteq\binom{[n]}{k}$ and $\mathcal B\subseteq\binom{[n]}{\ell}$ are called cross-$t$-intersecting if $|A\cap B|\geq t$ for all $A\in\mathcal A$, $B\in\mathcal B$. Let $n$, $k$ and $\ell$ be positive integers such that $n\geq 3.38\ell$ and $\ell\geq k\geq 2$. In this paper, we will determine the upper bound of $|\mathcal A||\mathcal B|$ for cross-$2$-intersecting families $\mathcal A\subseteq\binom{[n]}{k}$ and $\mathcal B\subseteq\binom{[n]}{\ell}$. The structures of the extremal families attaining the upper bound are also characterized. The similar result obtained by Tokushige can be considered as a special case of ours when $k=\ell$, but under a more strong condition $n>3.42k$. Moreover, combined with the results obtained in this paper, the complicated extremal structures attaining the upper bound for nontrivial cases can be relatively easy to reach with similar techniques.

Summary

We haven't generated a summary for this paper yet.

Lightbulb Streamline Icon: https://streamlinehq.com

Continue Learning

We haven't generated follow-up questions for this paper yet.

List To Do Tasks Checklist Streamline Icon: https://streamlinehq.com

Collections

Sign up for free to add this paper to one or more collections.