Bermudo's differential bound for graphs with forbidden induced cycles
Statement
Let be a graph of order with minimum degree , and suppose that contains no induced cycles of lengths in . The differential of a set is , where is the set of vertices outside having a neighbor in ; the differential of is . Bermudo's conjecture. Under these hypotheses,
This conjecture extends Bermudo's earlier lower bound for graphs of minimum degree two with specified forbidden tailed -cycle configurations. Its proposed bound concerns the differential of graphs subject to a family of forbidden induced cycle lengths; the source gives no resolution, so its status 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.