Highly Influenced

Let Σk consist of all k-graphs with three edges D1, D2, D3 such that |D1∩D2| = k − 1 and D1 △ D2 ⊆ D3. The exact value of the Turán function ex(n,Σk) was computed for k = 3 by Bollobás [Discrete Math., 8 (1974) 21–24] and for k = 4 by Sidorenko [Math Notes, 41 (1987) 247–259]. Let the k-graph Tk ∈ Σk have edges {1, . . . , k}, {1, 2, . . . , k − 1, k + 1… (More)

@article{Pikhurko2008AnET,
title={An exact Tur{\'a}n result for the generalized triangle},
author={Oleg Pikhurko},
journal={Combinatorica},
year={2008},
volume={28},
pages={187-208}
}