The maximum number of edges in a 3-graph not containing a given star
- 1 December 1987
- journal article
- Published by Springer Nature in Graphs and Combinatorics
- Vol. 3 (1) , 111-126
- https://doi.org/10.1007/bf01788535
Abstract
No abstract availableKeywords
This publication has 10 references indexed in Scilit:
- Exact solution of some Turán-type problemsJournal of Combinatorial Theory, Series A, 1987
- On unavoidable hypergraphsJournal of Graph Theory, 1987
- Forbidding just one intersectionJournal of Combinatorial Theory, Series A, 1985
- Unavoidable stars in 3-graphsJournal of Combinatorial Theory, Series A, 1983
- An extremal set theoretical characterization of some steiner systemsCombinatorica, 1983
- On unavoidable graphsCombinatorica, 1983
- On the combinatorial problems which I would most like to see solvedCombinatorica, 1981
- An extremal problem for 3-graphsActa Mathematica Hungarica, 1978
- INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETSThe Quarterly Journal of Mathematics, 1961
- Intersection Theorems for Systems of SetsJournal of the London Mathematical Society, 1960