Exact solution of the hypergraph Turán problem for k-uniform linear paths
- 8 February 2014
- journal article
- Published by Springer Nature in Combinatorica
- Vol. 34 (3) , 299-322
Abstract
No abstract availableKeywords
All Related Versions
This publication has 21 references indexed in Scilit:
- Unavoidable subhypergraphs: a-clustersJournal of Combinatorial Theory, Series A, 2011
- Hypergraph Extensions of the Erdős-Gallai TheoremElectronic Notes in Discrete Mathematics, 2010
- Monochromatic Hamiltonian t‐tight Berge‐cycles in hypergraphsJournal of Graph Theory, 2008
- An approximate Dirac-type theorem for k-uniform hypergraphsCombinatorica, 2008
- Exact solution of some Turán-type problemsJournal of Combinatorial Theory, Series A, 1987
- On a Packing and Covering ProblemEuropean Journal of Combinatorics, 1985
- On finite set-systems whose every intersection is a Kernel of a starDiscrete Mathematics, 1983
- On families of finite sets no two of which intersect in a singletonBulletin of the Australian Mathematical Society, 1977
- INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETSThe Quarterly Journal of Mathematics, 1961
- On maximal paths and circuits of graphsActa Mathematica Hungarica, 1959