Non-jumping numbers for 5-uniform hypergraphs

Abstract: Let

e l l

and

r

be integers. A real number

a l p h a i n [0, 1)

is a jump for

r

if for any

v a r e p s i l o n > 0

and any integer

m, m g e q r

, any

r

-uniform graph with

n > n_{0} (v a r e p s i l o n, m)

vertices and at least alpha+ varepsilon)�inom{n}{r}

e d g e s c o n t a i n s a s u b g r a p h w i t h

m

v e r t i c e s a n d a t l e a s t

(alpha +c)�inom{m}{r}

e d g e s, w h e r e

c=c(alpha)

d o e s n o t d e p e n d o n

varepsilon

a n d

m

. I t f o l l o w s f r o m a t h e o r e m o f E r d H o s, S t o n e a n d S i m o n o v i t s t h a t e v e r y

alpha in [0,1)

i s a j u m p f o r

r=2

. E r d H o s a s k e d w h e t h e r t h e s a m e i s t r u e f o r

r geq 3

1-frac{1}{ell^{r-1}}

i s n o t a j u m p f o r

r

i f

r geq 3

a n d

ell >2r

. P e n g g a v e m o r e s e q u e n c e s o f n o n - j u m p i n g n u m b e r s f o r

r=4

a n d

rgeq 3

. H o w e v e r, t h e r e a r e a l s o a l o t o f u n k n o w n s o n d e t e r m i n i n g w h e t h e r a n u m b e r i s a j u m p f o r

r geq 3

r=5

, a n d e x t e n d o n e o f t h e r e s u l t s t o e v e r y

r geq 5$, which generalize the above results.

Recommendations

Cites work

Cited in

(8)

This page was built for publication: Non-jumping numbers for 5-uniform hypergraphs