Two questions of Erdős on hypergraphs above the Tur{á}n threshold}

Details Two questions of Erdős on hypergraphs above the Tur{á}n threshold} Two questions of Erdős on hypergraphs above the Tur{á}n threshold}

2011-11-24

arxiv.org/abs/1111.5743v1

Mathematics

Combinatorics

Scientific paper

For ordinary graphs it is known that any graph $G$ with more edges than the Tur{\'a}n number of $K_s$ must contain several copies of $K_s$, and a copy of $K_{s+1}^-$, the complete graph on $s+1$ vertices with one missing edge. Erd\H{o}s asked if the same result is true for $K^3_s$, the complete 3-uniform hypergraph on $s$ vertices. In this note we show that for small values of $n$, the number of vertices in $G$, the answer is negative for $s=4$. For the second property, that of containing a ${K^3_{s+1}}^-$, we show that for $s=4$ the answer is negative for all large $n$ as well, by proving that the Tur{\'a}n density of ${K^3_5}^-$ is greater than that of $K^3_4$.

Affiliated with

Also associated with

No associations

Rating

Two questions of Erdős on hypergraphs above the Tur{á}n threshold} 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 Two questions of Erdős on hypergraphs above the Tur{á}n threshold}, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Two questions of Erdős on hypergraphs above the Tur{á}n threshold} will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-157211