Local triangle trees and K4-minor support girth
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 of triangles, there exists such that if (the above the arrow means with colors), then contains .
Question: For every , does there exist a graph which on every 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
- 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.