The perfect diameter-two graph conjecture for 2-bootstrap percolation
Statement
Let be the collection of all connected graphs of order at least with at most two blocks. A graph is 2-bootstrap good if it contains at least one pair of vertices that percolate under the bootstrap percolation process. A graph is perfect if every induced subgraph has a vertex whose neighborhood is a clique, and its diameter is the maximum graph distance between two vertices. The perfect diameter-two graph conjecture. If a graph in is perfect and its diameter is no more than , then the graph is 2-bootstrap good. This would give a sufficient structural condition for 2-bootstrap goodness within the class ; the supplied text does not indicate 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.