Table of Contents
Fetching ...

Size, diversity, minimum degree, sturdiness, dömdödöm

Balázs Patkós

TL;DR

The paper introduces the $(p,q)$-dömdödöm statistic $β_{p,q}({\mathcal{F}})$ for a family of sets, unifying size, minimum degree, diversity, and sturdiness into a single extremal framework. It analyzes the maximum $β_{p,q}(n,k)$ over all $k$-uniform intersecting families, linking its asymptotics to the covering number $τ({\mathcal{F}})$ and a constant $β(q)=β_{0,q}(n,q+1)$, and obtaining exact large-$n$ formulas $β_{p,1}(n,k)=\binom{n-3-p}{k-2-p}$ and $β_{p,2}(n,k)=2\binom{n-5}{k-3-p}-\binom{n-7}{k-5-p}$. The proofs combine maximal intersecting family structure, minimal covers, and covering-number bounds, and they identify extremal constructions such as a Fano-plane-based family. This work consolidates several classical invariants in extremal set theory under a single parameterized framework and highlights the principal open problem of determining $β(q)$.

Abstract

For a family $\mathcal{F}$ of sets and a disjoint pair $A,B$ we let $\mathcal{F}(A,\overline{B})=\{F\in \mathcal{F}: A\subseteq F, ~B\cap F=\emptyset\}$. The \textbf{$(p,q)$-dömdödöm} of a family $\mathcal{F}\subseteq 2^{[n]}$ is $β_{p,q}(\mathcal{F})=\min\{|\mathcal{F}(A,\overline{B})|:|A|=p,|B|=q, A\cap B=\emptyset, A,B\subseteq [n]\} $. This definition encompasses size, diversity, minimum degree, and sturdiness as special cases. We investigate the maximum possible value $β_{p,q}(n,k)$ of $β_{p,q}(\mathcal{F})$ over all $k$-uniform intersecting families $\mathcal{F}\subset 2^{[n]}$. We determine the order of magnitude of $β_{p,q}(n,k)$ for all fixed $p,q,k$. We relate the asymptotics of $β_{p,q}(n,k)$ to the constant value of $β_{0,q}(n,q+1)$ and establish $β_{p,1}(n,k)=\binom{n-3-p}{k-2-p}$ and $β_{p,2}(n,k)=2\binom{n-5}{k-3-p}-\binom{n-7}{k-5-p}$ if $n$ is large enough.

Size, diversity, minimum degree, sturdiness, dömdödöm

TL;DR

The paper introduces the -dömdödöm statistic for a family of sets, unifying size, minimum degree, diversity, and sturdiness into a single extremal framework. It analyzes the maximum over all -uniform intersecting families, linking its asymptotics to the covering number and a constant , and obtaining exact large- formulas and . The proofs combine maximal intersecting family structure, minimal covers, and covering-number bounds, and they identify extremal constructions such as a Fano-plane-based family. This work consolidates several classical invariants in extremal set theory under a single parameterized framework and highlights the principal open problem of determining .

Abstract

For a family of sets and a disjoint pair we let . The \textbf{-dömdödöm} of a family is . This definition encompasses size, diversity, minimum degree, and sturdiness as special cases. We investigate the maximum possible value of over all -uniform intersecting families . We determine the order of magnitude of for all fixed . We relate the asymptotics of to the constant value of and establish and if is large enough.
Paper Structure (3 sections, 6 theorems, 6 equations)

This paper contains 3 sections, 6 theorems, 6 equations.

Table of Contents

  1. Introduction
  2. Proofs
  3. Remarks

Key Result

Theorem 1.2

Let $k,p,q$ be fixed and ${\mathcal{F}}={\mathcal{F}}_n\subseteq \binom{[n]}{k}$ an intersecting family. If $\tau({\mathcal{F}})\le q$, then $\beta_{p,q}({\mathcal{F}})=0$. If $\tau({\mathcal{F}})>q$, then $\beta_{p,q}({\mathcal{F}})=O(n^{k-p-\tau({\mathcal{F}})})$.

Theorems & Definitions (12)

  • Definition 1.1
  • Theorem 1.2
  • Corollary 1.3
  • Theorem 1.4
  • Theorem 1.5
  • Theorem 2.1: ELGyT
  • proof : Proof of Theorem \ref{['tau']}
  • proof : Proof of Corollary \ref{['order']}
  • proof : Proof of Theorem \ref{['0q']}
  • Lemma 2.2
  • ...and 2 more