ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let G=(V,E)G=(V,E) be a finite simple undirected graph. Call a set of three edges of GG a triangle if these edges form a cycle of length 33, i.e. if they are {u,v},{v,w},{u,w}\{u,v\},\{v,w\},\{u,w\} for three distinct vertices u,v,w∈Vu,v,w \in V. Two triangles are edge-disjoint if they share no edge. Define

ν(G)=max⁡{∣T∣:T is a family of pairwise edge-disjoint triangles of G},\nu(G) = \max\{|\mathcal{T}| : \mathcal{T} \text{ is a family of pairwise edge-disjoint triangles of } G\}, τ(G)=min⁡{∣F∣:F⊆E and F∩T≠∅ for every triangle T of G},\tau(G) = \min\{|F| : F \subseteq E \text{ and } F \cap T \neq \emptyset \text{ for every triangle } T \text{ of } G\},

so that ν(G)\nu(G) is the maximum number of edge-disjoint triangles in GG and τ(G)\tau(G) is the minimum number of edges whose deletion leaves a triangle-free graph.

Then for every such graph GG,

τ(G)≤2 ν(G).\tau(G) \leq 2\,\nu(G).

Record

Added
Links

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.