The minimum size of 3-graphs without a 4-set spanning no or exactly three edges
Author:
- Oleg PikhurkoOPOleg Pikhurko
- 1 October 2011
- journal article
- Published by Elsevier in European Journal of Combinatorics
- Vol. 32 (7) , 1142-1155
Abstract
No abstract availableKeywords
Funding Information
- National Science Foundation (DMS-0758057)
This publication has 19 references indexed in Scilit:
- Hypergraph Turán problems2011
- Hypergraphs Do JumpCombinatorics, Probability and Computing, 2010
- Convergent sequences of dense graphs I: Subgraph frequencies, metric properties and testingAdvances in Mathematics, 2008
- Quadruple systems with independent neighborhoodsJournal of Combinatorial Theory, Series A, 2008
- On A Hypergraph Turán Problem Of FranklCombinatorica, 2005
- The Turán Number Of The Fano PlaneCombinatorica, 2005
- Triple Systems Not Containing a Fano ConfigurationCombinatorics, Probability and Computing, 2005
- Stability theorems for cancellative hypergraphsJournal of Combinatorial Theory, Series B, 2004
- An Upper Bound for the Turán Number t3(n, 4)Journal of Combinatorial Theory, Series A, 1999
- Supersaturated graphs and hypergraphsCombinatorica, 1983