4-books of three pages

Authors:
Zoltán Füredi;Oleg Pikhurko;Miklós Simonovits
Affiliations:
Department of Mathematics, University of Illinois at Urbana-Champaign, Urbana, IL and Rényi Institute of Mathematics of the Hungarian Academy of Sciences, Budapest, Hungary;Department of Mathematical Sciences, Carnegie Mellon University, Pittsburgh, PA;Rényi Institute of Mathematics of the Hungarian Academy of Sciences, Budapest, Hungary
Venue:
Journal of Combinatorial Theory Series A
Year:
2006

Citing 5
Cited 2

Extremal problems whose solutions are the blowups of the small Witt-designs

Journal of Combinatorial Theory Series A
On the Turán number of triple systems

Journal of Combinatorial Theory Series A
Extremal Graph Theory

Extremal Graph Theory
Stability theorems for cancellative hypergraphs

Journal of Combinatorial Theory Series B
On Triple Systems with Independent Neighbourhoods

Combinatorics, Probability and Computing

Two-regular subgraphs of hypergraphs

Journal of Combinatorial Theory Series B
Counting substructures II: Hypergraphs

Combinatorica

Quantified Score

Hi-index	0.00

Visualization

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 n0 e(H)≤(⌊n/2⌋/2) (⌈n/2⌉/2).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.