Hamid's independent transversal domination conjecture for bipartite graphs
Statement
Let be a connected bipartite graph. Write for its domination number and for its independent transversal domination number, the minimum cardinality of a dominating set meeting every maximum independent set. Hamid's conjecture.
Hamid proved the general bounds and, in particular, the asserted conclusion for trees; the claim remains presented here as a conjecture for connected bipartite graphs.
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.