Jet graphs of very well covered graphs are very well covered
Statement
Let be a very well covered graph, and for let denote its -th jet graph. A graph is very well covered if all its minimal vertex covers have the same cardinality and this cardinality is half the number of vertices. Jet-graph conjecture. For every , the graph is very well covered. The conjecture is motivated by the fact that jets of the complete bipartite graphs are very well covered, and computational evidence shows that the jets up to third order of Favaron's example of a very well covered graph have the same property; the general case 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.