Turán problems and shadows II: Trees
Authors:
- Alexandr KostochkaAKAlexandr Kostochka
- Dhruv MubayiDMDhruv Mubayi
- Jacques VerstraëteJVJacques Verstraëte
- 1 January 2017
- journal article
- Published by Elsevier in Journal of Combinatorial Theory, Series B
- Vol. 122, 457-478
Abstract
No abstract availableAll Related Versions
Funding Information
- NSF (DMS-1266016, DMS-1600592)
- President of Russia for Leading Scientific Schools (NSh.1939.2014.1)
- NSF (DMS-0969092, DMS-1300138)
- NSF (DMS-1101489)
This publication has 12 references indexed in Scilit:
- Turán problems and shadows I: Paths and cyclesJournal of Combinatorial Theory, Series A, 2015
- Hypergraph Turán numbers of linear cyclesJournal of Combinatorial Theory, Series A, 2014
- Exact solution of the hypergraph Turán problem for k-uniform linear pathsCombinatorica, 2014
- Linear trees in uniform hypergraphsEuropean Journal of Combinatorics, 2014
- A hypergraph extension of Turán's theoremJournal of Combinatorial Theory, Series B, 2006
- Exact solution of some Turán-type problemsJournal of Combinatorial Theory, Series A, 1987
- On families of finite sets no two of which intersect in a singletonBulletin of the Australian Mathematical Society, 1977
- On extremal problems of graphs and generalized graphsIsrael Journal of Mathematics, 1964
- Intersection Theorems for Systems of SetsJournal of the London Mathematical Society, 1960
- A Combinatorial TheoremJournal of the London Mathematical Society, 1950