Answers are grounded in this paper and cite their sources.
We prove that if each edge of a graph belongs to at least seven triangles, then contains a ‐minor or contains as an induced subgraph. This result was conjectured by Albar and Gonçalves in 2018. Moreover, we apply this result to study the stress freeness of graphs.
No takes yet. Share an insight, caveat, or question.
Takashige Akiyama (2024) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: