Odd-cycle transversal in triangle-free graphs
Statement
Conjecture If is a simple triangle-free graph, then there is a set of at most edges whose deletion destroys every odd cycle.
Record
- Source
- Added
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.