Name
Abstract | ||
|---|---|---|
Let r=2 be an integer. A real number @a@?[0,1) is a jump for r if there is a constant c0 such that for any @e0 and any integer m where m=r, there exists an integer n"0 such that any r-uniform graph with nn"0 vertices and density =@a+@e contains a subgraph with m vertices and density =@a+c. It follows from a fundamental theorem of Erdos and Stone that every @a@?[0,1) is a jump for r=2. Erdos asked whether the same is true for r=3. Frankl and Rodl gave a negative answer by showing some non-jumping numbers for every r=3. In this paper, we provide a recursive formula to generate more non-jumping numbers for every r=3 based on the current known non-jumping numbers. |
Year | DOI | Venue |
|---|---|---|
2008 | 10.1016/j.dam.2007.09.003 | Discrete Applied Mathematics |
Keywords | Field | DocType |
uniform hypergraphs,generating non-jumping numbers recursively,non-jumping number,non-jumping numbers,integer n,extremal hypergraph problems,lagrangians of uniform graphs,integer m,r-uniform graph,real number,recursive formula,fundamental theorem,m vertex,negative answer | Integer,Discrete mathematics,Graph,Combinatorics,Vertex (geometry),Jumping,Hypergraph,Fundamental theorem,Real number,Mathematics,Recursion | Journal |
Volume | Issue | ISSN |
156 | 10 | Discrete Applied Mathematics |
Citations | PageRank | References |
6 | 0.64 | 7 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Yuejian Peng | 1 | 112 | 14.82 |
| Cheng Zhao | 2 | 47 | 8.34 |