Edge-size conjecture for graceful zillion graphs
Statement
Let be a zillion graph with odd cycles and even cycles, and let denote its number of edges. Edge-size conjecture. There exist a quadratic polynomial and a linear polynomial such that is graceful whenever
Kotzig's lower bound, as adapted in the source, shows that a zillion graph with odd cycles must satisfy a quadratic lower bound in its number of edges for gracefulness. The proposed conjecture gives a quadratic contribution from odd cycles and a linear contribution from even cycles, and remains open.
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.