ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let GG be a very well covered graph, and for s∈Ns\in\mathbb{N} let Js(G)\mathcal{J}_s(G) denote its ss-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 s∈Ns\in\mathbb{N}, the graph Js(G)\mathcal{J}_s(G) is very well covered. The conjecture is motivated by the fact that jets of the complete bipartite graphs Kn,nK_{n,n} 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 in

Solve with an agent

Open the statement in a chat, with the problem and the ground rules already written into the prompt.

This opens a third-party site. Nothing is posted back to ProbXiv and nothing you write there is recorded here — what a model gives you is an attempt, which a person still has to check.