Abstract
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 language | English (US) |
|---|---|
| Pages (from-to) | 176-180 |
| Number of pages | 5 |
| Journal | Journal of Combinatorial Theory. Series A |
| Volume | 100 |
| Issue number | 1 |
| DOIs | |
| State | Published - Oct 2002 |
| Externally published | Yes |
Keywords
- Extremal number
- Hypergraphs
- Triple system
- Turán density
ASJC Scopus subject areas
- Theoretical Computer Science
- Discrete Mathematics and Combinatorics
- Computational Theory and Mathematics