Loading...
Please wait, while we are loading the content...
Similar Documents
The Turán Number of $F_{3,3}$
| Content Provider | Scilit |
|---|---|
| Author | Keevash, Peter Mubayi, Dhruv |
| Copyright Year | 2011 |
| Description | Let $F_{3,3}$ be the 3-graph on 6 vertices, labelled abcxyz, and 10 edges, one of which is abc, and the other 9 of which are all triples that contain 1 vertex from abc and 2 vertices from xyz. We show that for all n ≥ 6, the maximum number of edges in an $F_{3,3}$-free 3-graph on n vertices is $\binom{n}{3} - \binom{\lfloor n/2 \rfloor}{3} - \binom{\lceil n/2 \rceil}{3}$ . This sharpens results of Zhou [9] and of the second author and Rödl [7]. |
| Related Links | http://pdfs.semanticscholar.org/2cad/de5a9a1a5a9def56dfc1af705f87732d3c17.pdf http://journals.cambridge.org/article_S0963548311000678 |
| Ending Page | 456 |
| Page Count | 6 |
| Starting Page | 451 |
| ISSN | 09635483 |
| e-ISSN | 14692163 |
| DOI | 10.1017/s0963548311000678 |
| Journal | Combinatorics, Probability and Computing |
| Issue Number | 3 |
| Volume Number | 21 |
| Language | English |
| Publisher | Cambridge University Press (CUP) |
| Publisher Date | 2011-11-29 |
| Access Restriction | Open |
| Subject Keyword | Combinatorics, Probability and Computing Primary 05c35 |
| Content Type | Text |
| Resource Type | Article |
| Subject | Applied Mathematics Statistics and Probability Theoretical Computer Science Computational Theory and Mathematics |