ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let Γ\Gamma be a zillion graph with ω\omega odd cycles and μ\mu even cycles, and let ∣E(Γ)∣|E(\Gamma)| denote its number of edges. Edge-size conjecture. There exist a quadratic polynomial f∈Z[x]f\in\mathbb{Z}[x] and a linear polynomial g∈Z[x]g\in\mathbb{Z}[x] such that Γ\Gamma is graceful whenever

∣E(Γ)∣≥f(ω)+g(μ).|E(\Gamma)|\geq f(\omega)+g(\mu).

Kotzig's lower bound, as adapted in the source, shows that a zillion graph with ω\omega 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 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.