Tuza's conjecture
Statement
Let be a finite simple undirected graph. Call a set of three edges of a triangle if these edges form a cycle of length , i.e. if they are for three distinct vertices . Two triangles are edge-disjoint if they share no edge. Define
so that is the maximum number of edge-disjoint triangles in and is the minimum number of edges whose deletion leaves a triangle-free graph.
Then for every such graph ,
Record
- 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.