The turán density of triple systems is not principal

Research output: Contribution to journalArticlepeer-review


The Erdos-Stone-Simonovits Theorem implies that the Turán density of a family of graphs is the minimum of the Turán densities of the individual graphs from the family. It was conjectured by Mubayi and Rödl (J. Combin. Theory Ser. A, submitted) that this is not necessarily true for hypergraphs, in particular for triple systems. We give an example, which shows that their conjecture is true.

Original languageEnglish (US)
Pages (from-to)176-180
Number of pages5
JournalJournal of Combinatorial Theory. Series A
Issue number1
StatePublished - Oct 2002
Externally publishedYes


  • Extremal number
  • Hypergraphs
  • Triple system
  • Turán density

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Discrete Mathematics and Combinatorics
  • Computational Theory and Mathematics


Dive into the research topics of 'The turán density of triple systems is not principal'. Together they form a unique fingerprint.

Cite this