ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let GG be a graph with ∣V(G)∣≥2|V(G)|\geq 2. The prime bound p(G)p(G) is the smallest integer such that GG admits a prime p(G)p(G)-extension; here α(G)\alpha(G) denotes the stability number and ω(G)\omega(G) the clique number. Brignall's prime bound conjecture.

p(G)≤⌈log⁡2(max⁡(α(G),ω(G))+1)⌉.p(G)\leq\left\lceil\log_2\bigl(\max(\alpha(G),\omega(G))+1\bigr)\right\rceil.

This would improve the general upper bound obtained from the number of vertices by replacing ∣V(G)∣|V(G)| with the larger of the stability and clique numbers. The supplied source does not state whether the conjecture has been resolved.

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.