On large systems of sets with no large weak Δ-subsystems

A. V. Kostochka, V. Rödl

Research output: Contribution to journalArticlepeer-review

Abstract

A family of sets is called a weak Δ-system if the cardinality of the intersection of any two sets is the same. We elaborate a construction by Rödl and Thoma [9] and show that for large n, there exists a family ℱ of subsets of {1, . . . , n} without weak Δ-systems of size 3 with \ℱ\ ≥ 2c(n log n)1/3.

Original languageEnglish (US)
Pages (from-to)235-240
Number of pages6
JournalCombinatorica
Volume18
Issue number2
DOIs
StatePublished - 1998
Externally publishedYes

ASJC Scopus subject areas

  • Discrete Mathematics and Combinatorics
  • Computational Mathematics

Fingerprint

Dive into the research topics of 'On large systems of sets with no large weak Δ-subsystems'. Together they form a unique fingerprint.

Cite this