Lower bound on the profile of degree pairs in cross-intersecting set systems

Abstract

We raise the following problem. For natural numbers m, n ≥ 2, determine pairs d′, d″ (both depending on m and n only) with the property that in every pair of set systems A, B with |A| ≤ m, |B| ≤ n, and AB ≠ 0 for all AA, BB, there exists an element contained in at least d′ |A| members of A and d″ |B| members of B. Generalizing a previous result of Kyureghyan, we prove that all the extremal pairs of (d′, d″) lie on or above the line (n − 1) x + (m − 1) y = 1. Constructions show that the pair (1 + ɛ / 2n − 2, 1 + ɛ / 2m − 2) is infeasible in general, for all m, n ≥ 2 and all ɛ > 0. Moreover, for m = 2, the pair (d′, d″) = (1 / n, 1 / 2) is feasible if and only if 2 ≤ n ≤ 4.

The problem originates from Razborov and Vereshchagin’s work on decision tree complexity.

This is a preview of subscription content, access via your institution.

References

  1. [1]

    M. Całczyńska-Karłowicz: Theorem on families of finite sets, Bull. Acad. Polon. Sci. Sér. Sci. Math. Astronom. Phys. 12 (1964), 87–89.

    Google Scholar 

  2. [2]

    A. Ehrenfeucht and J. Mycielski: Interpolation of functions over a measure space and conjectures about memory, J. Approximation Theory 9 (1973), 218–236.

    MATH  Article  MathSciNet  Google Scholar 

  3. [3]

    G. M. Kyureghyan: On a degree property of cross-intersecting families, Combinatorica 21(3) (2001), 449–453.

    MATH  Article  MathSciNet  Google Scholar 

  4. [4]

    A. A. Razborov and N. K. Vereshchagin: A property of cross-intersecting families, in Paul Erdős and his Mathematics, Research Communications of the Conference held in the Memory of Paul Erdős, Budapest, Hungary, July 4–11, 1999 (A. Sali et al., eds.), J. Bolyai Math. Soc., Budapest, 1999, pp. 218–220.

    Google Scholar 

  5. [5]

    Zs. Tuza: On two intersecting set systems and k-continuous Boolean functions, Discrete Applied Math. 16 (1987), 183–185.

    MATH  Article  MathSciNet  Google Scholar 

  6. [6]

    Zs. Tuza: Applications of the set-pair method in extremal hypergraph theory, in Extremal problems for finite sets (P. Frankl et al., eds.), Bolyai Society Mathematical Studies 3, J. Bolyai Math. Soc., Budapest, 1994, pp. 479–514.

    Google Scholar 

  7. [7]

    Zs. Tuza: Applications of the set-pair method in extremal problems, II; in: Combinatorics, Paul Erdős is Eighty (D. Miklós et al., eds.), Bolyai Society Mathematical Studies 2, J. Bolyai Math. Soc., Budapest, 1996, pp. 459–490.

    Google Scholar 

Download references

Author information

Affiliations

Authors

Corresponding author

Correspondence to Zsuzsanna Szaniszló.

Additional information

Research supported in part by the Hungarian Research Fund under grant OTKA T-032969.

Rights and permissions

Reprints and Permissions

About this article

Cite this article

Szaniszló, Z., Tuza, Z. Lower bound on the profile of degree pairs in cross-intersecting set systems. Combinatorica 27, 399–405 (2007). https://doi.org/10.1007/s00493-007-2105-z

Download citation

Mathematics Subject Classification (2000)

  • 05C65
  • 05C35