Exponent improvement conjecture for even prisms
Statement
For each integer , consider the Cartesian product of the cycle and the path . The notation denotes the maximum number of edges in an -vertex graph containing no copy of . Even-prism exponent improvement conjecture. For every , there exists such that
This would improve the currently stated general upper bound ; 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 inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.