Hypergraphs do jump

Details Hypergraphs do jump Hypergraphs do jump

2010-04-21

arxiv.org/abs/1004.3733v2

Mathematics

Combinatorics

11 pages, 1 figure, 42 page appendix of C++ code. Revised version including new Corollary 2.3 thanks to an observation of Dhru

Scientific paper

We say that $\alpha\in [0,1)$ is a jump for an integer $r\geq 2$ if there exists $c(\alpha)>0$ such that for all $\epsilon >0 $ and all $t\geq 1$ any $r$-graph with $n\geq n_0(\alpha,\epsilon,t)$ vertices and density at least $\alpha+\epsilon$ contains a subgraph on $t$ vertices of density at least $\alpha+c$. The Erd\H os--Stone--Simonovits theorem implies that for $r=2$ every $\alpha\in [0,1)$ is a jump. Erd\H os showed that for all $r\geq 3$, every $\alpha\in [0,r!/r^r)$ is a jump. Moreover he made his famous "jumping constant conjecture" that for all $r\geq 3$, every $\alpha \in [0,1)$ is a jump. Frankl and R\"odl disproved this conjecture by giving a sequence of values of non-jumps for all $r\geq 3$. We use Razborov's flag algebra method to show that jumps exist for $r=3$ in the interval $[2/9,1)$. These are the first examples of jumps for any $r\geq 3$ in the interval $[r!/r^r,1)$. To be precise we show that for $r=3$ every $\alpha \in [0.2299,0.2316)$ is a jump. We also give an improved upper bound for the Tur\'an density of $K_4^-=\{123,124,134\}$: $\pi(K_4^-)\leq 0.2871$. This in turn implies that for $r=3$ every $\alpha \in [0.2871,8/27)$ is a jump.

Affiliated with

Also associated with

No associations

Rating

Hypergraphs do jump 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 Hypergraphs do jump, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Hypergraphs do jump will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-327382