| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 4652142 | Electronic Notes in Discrete Mathematics | 2013 | 7 Pages |
Abstract
We show that for every ε>0 there exist δ>0 and n0∈N such that every 3-uniform hypergraph on n⩾n0 vertices with the property that every k-vertex subset, where k⩾δn, induces at least edges, contains as a subgraph, where is the 3-uniform hypergraph on 4 vertices with 3 edges. This question was originally raised by Erdős and Sós. The constant 1/4 is the best possible.
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
