The minor conjecture for triangles and induced minors
Let be a graph. A minor of is obtained by deleting vertices and edges and contracting edges; an induced minor is obtained by deleting vertices and edges and contracting connected vertex sets. A triangle is a cycle of length three.
minor conjecture. If contains as a minor, then contains a triangle as a subgraph or contains as an induced minor.
This proposes a structural consequence of having a minor, separating the presence of a triangle from the induced-minor obstruction . The source presents it as an open proposal and gives no resolution.
References
Primary source
Maria Chudnovsky, Meike Hatzel, Tuukka Korhonen, Nicolas Trotignon and Sebastian Wiederrecht, “Unavoidable induced subgraphs in graphs with complete bipartite induced minors”, arXiv:2405.01879 (2025).
Progress summary
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Solutions 0
No solutions have been posted yet.