ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Local trees of triangles

Vojt\v{e}ch R"odl

A tree of triangles is any graph built recursively by starting with a triangle, and then adding two edges at a time that forms a single new triangle with an existing edge.

Known: Given any tree TT of triangles, there exists kk such that if G→kK3G \xrightarrow{k} K_3 (the kk above the arrow means with kk colors), then GG contains TT.

Question: For every ℓ\ell, does there exist a graph G→2K3G \xrightarrow{2} K_3 which on every ℓ\ell vertices induces a subgraph of a tree of triangles.

The property in the conclusion of the question will be referred to as locally a tree of triangles.

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.