Indexed metadata

On Systems of Small Sets with No Large Δ-Subsystems

A. V. KOSTOCHKA, V. RÖDL, L. A. TALYSHEVA

Source record

Source: Crossref

Published: May 1, 1999

DOI: 10.1017/s0963548399003818

Open original source ↗

Source abstract

A family of k sets is called a Δ- system if any two sets have the same intersection. Denote by f ( r , k ) the least integer so that any r -uniform family of f ( r , k ) sets contains a Δ-system consisting of k sets. We prove that, for every fixed r , f ( r , k ) = k r + o ( k r ). Using a recent result of Molloy and Reed [5], a bound on the error term is provided for sufficiently large k .

Evidence graph

No public relationships recorded yet.

Integrity note: This page is a factual metadata record created by deterministic ingestion. It is not a claim that the work moves a mathematical frontier or has been independently verified.

On Systems of Small Sets with No Large Δ-Subsystems — Mathematical Frontier Network