Upper bound for outer general position number after vertex removal
Statement
Let be a graph and let be a vertex that is not a cut vertex of . Write for the outer general position number of and for the degree of in . Upper-bound conjecture. If is not a cut vertex of , then
This would provide a general upper bound for the change in outer general position number under deletion of a non-cut vertex. Together with the preceding lower-bound theorem for vertices lying in an outer general position set, it would constrain how vertex removal affects ; the supplied text does not indicate whether the proposed bound is known or 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.