On set systems without weak 3-Δ-subsystems

M. Axenovich, D. Fon-Der-Flaass, A. Kostochka

Research output: Contribution to journalArticlepeer-review


A collection of sets is called a weak Δ-system if sizes of all pairwise intersections of these sets coincide. We prove a new upper bound on the function fw(n), the maximal size of a collection of n-element sets no three of which form a weak Δ-system. Namely, we prove that, for every δ > 0. fw(n) = 0(n! 1 2 + b).

Original languageEnglish (US)
Pages (from-to)57-62
Number of pages6
JournalDiscrete Mathematics
Issue number1-3
StatePublished - Mar 6 1995
Externally publishedYes

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Discrete Mathematics and Combinatorics


Dive into the research topics of 'On set systems without weak 3-Δ-subsystems'. Together they form a unique fingerprint.

Cite this