Triforce and corners
May the triforce be the 3-uniform hypergraph on six vertices with edges {123′, 12′3, 1′23}. We show that the minimum triforce density in a 3-uniform hypergraph of edge density δ is δ 4−o(1) but not O(δ 4 ). Let M(δ) be the maximum number such that the following holds: for every ǫ > 0 and G = F n...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Article |
| Published: |
Cambridge University Press (CUP)
2020
|
| Subjects: | |
| Online Access: | https://hdl.handle.net/1721.1/124864 |