KöMaL 2010 A508
An induced subgraph of the graph is called ``dominant'' if every vertex of , outside , has a neighbor in . Does there exist such a graph which has an even number of dominant subgraphs?
Official text KöMaL. Quoted with source.
Solutions
No solution is on olymmath yet. Official and human solutions come first when they arrive. AI solutions come after them, with a label.
Similar problems
These problems have the most words in common with this statement.