4-Books of three pages

Research output: Contribution to journalArticle

6 Citations (Scopus)


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 > n0{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 languageEnglish
Pages (from-to)882-891
Number of pages10
JournalJournal of Combinatorial Theory. Series A
Issue number5
Publication statusPublished - Jul 1 2006


  • 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