Informace o publikaci
A PROBLEM OF ERDOS AND SOS ON 3-GRAPHS
| Autoři | |
|---|---|
| Rok publikování | 2016 |
| Druh | Článek v odborném periodiku |
| Časopis / Zdroj | Israel Journal of Mathematics |
| Citace | |
| Doi | http://dx.doi.org/10.1007/s11856-015-1267-4 |
| Popis | We show that for every epsilon > 0 there exist delta > 0 and n(0) is an element of N such that every 3-uniform hypergraph on n >= n(0) vertices with the property that every k-vertex subset, where k >= delta n, induces at least (1/4 + epsilon) ((k)(3)) edges, contains K-4- as a subgraph, where K-4- is the 3-uniform hypergraph on 4 vertices with 3 edges. This question was originally raised by Erdos and Sos. The constant 1/4 is the best possible. |