The Turán number of $F_{3,3}$

Details The Turán number of $F_{3,3}$ The Turán number of $F_{3,3}$

2011-02-10

arxiv.org/abs/1102.2141v1

Mathematics

Combinatorics

6 pages

Scientific paper

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 \ge 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 and of the second author and R\"odl.

Affiliated with

Also associated with

No associations

Rating

The Turán number of $F_{3,3}$ does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with The Turán number of $F_{3,3}$, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and The Turán number of $F_{3,3}$ will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-694587