Skip to main content
CenXiv.org
This website is in trial operation, support us!
We gratefully acknowledge support from all contributors.
Contribute
Donate
cenxiv logo > math > arXiv:2306.00384v1

Help | Advanced Search

Mathematics > Combinatorics

arXiv:2306.00384v1 (math)
[Submitted on 1 Jun 2023 ]

Title: A generalization of diversity for intersecting families

Title: 相交族的多样性推广

Authors:Van Magnan, Cory Palmer, Ryan Wood
Abstract: Let $\mathcal{F}\subseteq \binom{[n]}{r}$ be an intersecting family of sets and let $\Delta(\mathcal{F})$ be the maximum degree in $\mathcal{F}$, i.e., the maximum number of edges of $\mathcal{F}$ containing a fixed vertex. The \emph{diversity} of $\mathcal{F}$ is defined as $d(\mathcal{F}) := |\mathcal{F}| - \Delta(\mathcal{F})$. Diversity can be viewed as a measure of distance from the `trivial' maximum-size intersecting family given by the Erd\H os-Ko-Rado Theorem. Indeed, the diversity of this family is $0$. Moreover, the diversity of the largest non-trivial intersecting family \`a la Hilton-Milner is $1$. It is known that the maximum possible diversity of an intersecting family $\mathcal{F}\subseteq \binom{[n]}{r}$ is $\binom{n-3}{r-2}$ as long as $n$ is large enough. We introduce a generalization called the \emph{$C$-weighted diversity} of $\mathcal{F}$ as $d_C(\mathcal{F}) := |\mathcal{F}| - C \cdot \Delta(\mathcal{F})$. We determine the maximum value of $d_C(\mathcal{F})$ for intersecting families $\mathcal{F} \subseteq \binom{[n]}{r}$ and characterize the maximal families for $C\in \left[0,\frac{7}{3}\right)$ as well as give general bounds for all $C$. Our results imply, for large $n$, a recent conjecture of Frankl and Wang concerning a related diversity-like measure. Our primary technique is a variant of Frankl's Delta-system method.
Abstract: 设$\mathcal{F}\subseteq \binom{[n]}{r}$为一个集合的相交族,令$\Delta(\mathcal{F})$为$\mathcal{F}$中的最大度数,即包含固定顶点的$\mathcal{F}$的边的最大数量。 \emph{多样性}是$\mathcal{F}$的定义为$d(\mathcal{F}) := |\mathcal{F}| - \Delta(\mathcal{F})$。 多样性可以看作是从由 Erdős-Ko-Rado 定理给出的“平凡”的最大大小相交族的距离的度量。 确实,这个族的多样性是$0$。 此外,Hilton-Milner 类型的最大非平凡相交族的多样性是$1$。 已知相交族的最大可能多样性$\mathcal{F}\subseteq \binom{[n]}{r}$在$n$足够大时是$\binom{n-3}{r-2}$。 我们引入了一个称为\emph{$C$加权多样性}的推广,即$\mathcal{F}$作为$d_C(\mathcal{F}) := |\mathcal{F}| - C \cdot \Delta(\mathcal{F})$。 我们确定了对于相交族$\mathcal{F} \subseteq \binom{[n]}{r}$的$d_C(\mathcal{F})$的最大值,并对$C\in \left[0,\frac{7}{3}\right)$的极大族进行了表征,同时还给出了所有$C$的一般界。 我们的结果表明,对于大的$n$,一个关于相关多样性度量的Frankl和Wang的近期猜想成立。 我们主要的技术是一种Frankl的Delta系统方法的变体。
Subjects: Combinatorics (math.CO)
Cite as: arXiv:2306.00384 [math.CO]
  (or arXiv:2306.00384v1 [math.CO] for this version)
  https://doi.org/10.48550/arXiv.2306.00384
arXiv-issued DOI via DataCite

Submission history

From: Cory Palmer [view email]
[v1] Thu, 1 Jun 2023 06:31:52 UTC (12,748 KB)
Full-text links:

Access Paper:

    View a PDF of the paper titled
  • View Chinese PDF
  • View PDF
  • TeX Source
view license
Current browse context:
math.CO
< prev   |   next >
new | recent | 2023-06
Change to browse by:
math

References & Citations

  • NASA ADS
  • Google Scholar
  • Semantic Scholar
a export BibTeX citation Loading...

BibTeX formatted citation

×
Data provided by:

Bookmark

BibSonomy logo Reddit logo

Bibliographic and Citation Tools

Bibliographic Explorer (What is the Explorer?)
Connected Papers (What is Connected Papers?)
Litmaps (What is Litmaps?)
scite Smart Citations (What are Smart Citations?)

Code, Data and Media Associated with this Article

alphaXiv (What is alphaXiv?)
CatalyzeX Code Finder for Papers (What is CatalyzeX?)
DagsHub (What is DagsHub?)
Gotit.pub (What is GotitPub?)
Hugging Face (What is Huggingface?)
Papers with Code (What is Papers with Code?)
ScienceCast (What is ScienceCast?)

Demos

Replicate (What is Replicate?)
Hugging Face Spaces (What is Spaces?)
TXYZ.AI (What is TXYZ.AI?)

Recommenders and Search Tools

Influence Flower (What are Influence Flowers?)
CORE Recommender (What is CORE?)
IArxiv Recommender (What is IArxiv?)
  • Author
  • Venue
  • Institution
  • Topic

arXivLabs: experimental projects with community collaborators

arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.

Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.

Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.

Which authors of this paper are endorsers? | Disable MathJax (What is MathJax?)
  • About
  • Help
  • contact arXivClick here to contact arXiv Contact
  • subscribe to arXiv mailingsClick here to subscribe Subscribe
  • Copyright
  • Privacy Policy
  • Web Accessibility Assistance
  • arXiv Operational Status
    Get status notifications via email or slack

京ICP备2025123034号