The cut-partition conjecture for t-triangles in fullerenes
The cut-partition conjecture for t-triangles in fullerenes
Let and denote the indicated fullerene graphs. A cut-partition of a hexagonal subgraph is the set of components generated by the stated cut-partition construction, and a -triangle is the triangle type defined in the source. Cut-partition t-triangle conjecture. and are the only fullerenes whose cut-partition consists solely of -triangles.
The claim is based on numerical results about cut-partitions of hexagonal subgraphs. No proof or disproof is supplied in the source.
Sources & referencesView supporting material
Primary source
Artur Bille, Victor Buchstaber and Evgeny Spodarev, “Some open mathematical problems on fullerenes”, arXiv:2410.19322 (2024).
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
Sign in to submit a solution.
No solutions have been posted yet.