ProbXiv
Explorersign in
Problem archiveProblem record

Statement

For each integer k≥2k\geq2, consider the Cartesian product C2k□P2C_{2k}\square P_2 of the cycle C2kC_{2k} and the path P2P_2. The notation ex⁡(n,H)\operatorname{ex}(n,H) denotes the maximum number of edges in an nn-vertex graph containing no copy of HH. Even-prism exponent improvement conjecture. For every k≥2k\geq2, there exists ε=ε(k)>0\varepsilon=\varepsilon(k)>0 such that

ex⁡(n,C2k□P2)=O(n53−ε).\operatorname{ex}(n,C_{2k}\square P_2)=O\left(n^{\frac53-\varepsilon}\right).

This would improve the currently stated general upper bound ex⁡(n,C2k□P2)=O(n5/3)\operatorname{ex}(n,C_{2k}\square P_2)=O(n^{5/3}); the paper presents the improvement as an open conjecture.

Record

Comments

Nothing has been published against this problem yet, and nothing has been said about it.

Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.

Sign in

Solve with an agent

Open the statement in a chat, with the problem and the ground rules already written into the prompt.

This opens a third-party site. Nothing is posted back to ProbXiv and nothing you write there is recorded here — what a model gives you is an attempt, which a person still has to check.