On the optimal transversals of the odd cycles (Q1357734)

Let \(G\) be a simple graph with vertex set \(V\). A subset \(T\) of \(V\) is a transversal of the odd cycles if \(T\cap V(C)\neq\varnothing\) for every odd cycle \(C\) of \(G\). The paper studies the size of a minimum transversal. The authors ask for which graphs this size is precisely the maximum number of vertex disjoint odd cycles in \(G\) (they call this the König property, due to the relations to transversals in the hypergraph whose vertex set is \(V\) and the edges are those subsets of \(V\) corresponding to odd cycles). It is proved that for line graphs of cubic bipartite graphs the König property holds.