Turán problems and shadows I: Paths and cycles
Authors:
- Alexandr KostochkaAKAlexandr Kostochka
- Dhruv MubayiDMDhruv Mubayi
- Jacques VerstraëteJVJacques Verstraëte
- 1 January 2015
- journal article
- Published by Elsevier in Journal of Combinatorial Theory, Series A
- Vol. 129, 57-79
Abstract
No abstract availableAll Related Versions
Funding Information
- NSF
- Russian Foundation for Basic Research (12-01-00631)
- NSF
- NSF (DMS-0965587, DMS-1266016, DMS-0969092, DMS-1300138, DMS-1362650, DMS-1101489)
This publication has 22 references indexed in Scilit:
- Pentagons vs. trianglesDiscrete Mathematics, 2008
- A Homological Approach to Two Problems on Finite SetsJournal of Algebraic Combinatorics, 1999
- Exact solution of some Turán-type problemsJournal of Combinatorial Theory, Series A, 1987
- Hypergraphs in which all disjoint pairs have distinct unionsCombinatorica, 1984
- On families of finite sets no two of which intersect in a singletonBulletin of the Australian Mathematical Society, 1977
- An Extremal Set-Intersection TheoremJournal of the London Mathematical Society, 1974
- Cycles of even length in graphsJournal of Combinatorial Theory, Series B, 1974
- On extremal problems of graphs and generalized graphsIsrael Journal of Mathematics, 1964
- INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETSThe Quarterly Journal of Mathematics, 1961
- On maximal paths and circuits of graphsActa Mathematica Hungarica, 1959