The smallest speed above 2 conjecture

About 19 years old · traced to

Let S\mathcal{S} denote the set of exponential growth constants arising from hereditary properties of ordered graphs. The conjecture identifies the first member of this set strictly greater than 22.

Smallest-speed-above-2 conjecture. The smallest c∈Sc\in\mathcal{S} with c>2c>2 is the largest real root of

x5=x4+x3+x2+2x+1,x^5=x^4+x^3+x^2+2x+1,

and is approximately 2.032.03.

The paper gives an example of a hereditary property whose speed realizes this candidate value. The supplied text gives no proof or later resolution of the identification.

References

Primary source

József Balogh, Béla Bollobás and Robert Morris, “Hereditary properties of ordered graphs”, arXiv:math/0702352 (2007).

Progress summary

Never refreshed

Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.

Solutions 0

No solutions have been posted yet.