### Abstract

Let H be a 4-uniform hypergraph on an n-element vertex set V containing no 4-book of 3 pages, i.e., a hypergraph of 4 quadruples with vertices { 1, 2, ..., 7 } and edges { 1234, 1235, 1236, 4567 }. Then for n > n_{0}{A formula is presented}Moreover, here equality is possible only if V ( H ) can be partitioned into two sets A and B so that each quadruple of H intersects A (and B) in exactly two vertices.

Original language | English |
---|---|

Pages (from-to) | 882-891 |

Number of pages | 10 |

Journal | Journal of Combinatorial Theory. Series A |

Volume | 113 |

Issue number | 5 |

DOIs | |

Publication status | Published - Jul 1 2006 |

### Keywords

- Booklike hypergraph
- Stability result
- Turán function

### ASJC Scopus subject areas

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

## Fingerprint Dive into the research topics of '4-Books of three pages'. Together they form a unique fingerprint.

## Cite this

Füredi, Z., Pikhurko, O., & Simonovits, M. (2006). 4-Books of three pages.

*Journal of Combinatorial Theory. Series A*,*113*(5), 882-891. https://doi.org/10.1016/j.jcta.2005.03.012