Paper Info
Title
The minimum size of 3-graphs without a 4-set spanning no or exactly three edges
Abstract
Let G"i be the (unique) 3-graph with 4 vertices and i edges. Razborov [A. Razborov, On 3-hypergraphs with forbidden 4-vertex configurations, SIAM J. Discrete Math. 24 (2010) 946-963] determined asymptotically the minimum size of a 3-graph on n vertices having neither G"0 nor G"3 as an induced subgraph. Here we obtain the corresponding stability result, determine the extremal function exactly, and describe all extremal hypergraphs for n=n"0. It follows that any sequence of almost extremal hypergraphs converges, which answers in the affirmative a question posed by Razborov.
Year
DOI
Venue
2011
10.1016/j.ejc.2011.03.006
Eur. J. Comb.
Keywords
Field
DocType
4-vertex configuration,extremal hypergraphs,induced subgraph,n vertex,corresponding stability result,i edge,minimum size,extremal hypergraphs converges,extremal function,siam j. discrete math
Discrete mathematics,Graph,Combinatorics,Vertex (geometry),Constraint graph,Induced subgraph,Mathematics
Journal
Volume
Issue
ISSN
32
7
0195-6698
Citations 
PageRank 
References 
8
0.99
17
Authors
1
Name
Order
Citations
PageRank
Oleg Pikhurko131847.03