Reed's domination conjecture for connected cubic graphs
Statement
Let be a connected cubic graph, and let denote its vertex set. A dominating set is a subset of vertices such that every vertex outside the subset has a neighbor in it. Reed's conjecture. Every connected cubic graph contains a dominating set of at most
vertices. This conjecture gives a universal upper bound on the domination number of connected cubic graphs; the source presents it as a statement that has been suggested and widely discussed, without supplying evidence of a resolution.
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.