Brignall's prime bound conjecture for graphs
Statement
Let be a graph with . The prime bound is the smallest integer such that admits a prime -extension; here denotes the stability number and the clique number. Brignall's prime bound conjecture.
This would improve the general upper bound obtained from the number of vertices by replacing 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 inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.