13 problems
- 0 votes0 replies1 view
The 120-cell isoperimetric optimality conjecture
Isoperimetric optimality conjecture. The 120-cell has the least volume among all 4-polytopes of unit in-radius having 120 cells.
- 0 votes0 replies1 view
DDF's tight fullerene existence conjecture
DDF's conjecture. For every even with , there exists a tight .
- 0 votes0 replies0 views
Minimal-volume conjecture for exceptional-order fullerenes
Let be the class of fullerene isomers with atoms. Assume , , and , where and . A nanotubical fullerene gra…
- 0 votes0 replies0 views
Minimal-volume conjecture for fullerenes with 6k-4 atoms
Let be the class of fullerene isomers with atoms. Suppose , where and . A nanotubical fullerene has a tubular part and two caps, and ca…
- 0 votes0 replies0 views
Minimal-volume conjecture for fullerenes with 10k atoms
Let be the class of fullerene isomers with atoms, and let with . A nanotubical fullerene has a tubular part and two caps; a cap of type (a) is one of the…
- 0 votes0 replies0 views
Maximal-Wiener-index fullerene conjecture
Let a fullerene graph be a graph of an arbitrary order, and let its Wiener index be the sum of graph distances over all unordered pairs of vertices. A nanotubical fullerene graph i…
- 0 votes0 replies0 views
Spectral characterization conjecture for fullerene isomers
Spectral characterization conjecture. (a) For all feasible , two -isomers are isomorphic if and only if they are cospectral with respect to .
- 0 votes0 replies2 views
The chemical-stability conjecture for icosahedral fullerenes
Chemical-stability conjecture. The family of icosahedral fullerenes has the highest chemical stability among all fullerenes with atoms.
- 0 votes0 replies1 view
Conjectured upper bound for the saturation number of fullerene graphs
Fullerene saturation-number conjecture. There is a constant such that
- 0 votes0 replies0 views
Existence conjecture for fullerene -disks
Fullerene disk existence conjecture. Except for , , and , a fullerene -disk with and vertices exists if and only if is even and
- 0 votes0 replies0 views
Minimal fullerene thimble conjecture
Minimal fullerene thimble conjecture. For odd or even , respectively, the stated - or -vertex -thimble is minimal.
- 0 votes0 replies0 views
Došlić–Vukićević explicit conjecture for bipartizing fullerenes
Let be a fullerene graph with vertices, and let be the minimum number of edges whose removal makes bipartite. Došlić–Vukićević explicit conjecture. … This is pr…
- 0 votes0 replies0 views
Došlić–Vukićević conjecture on bipartizing fullerenes
Let be a fullerene graph, let denote its vertex set, and let be the minimum number of edges whose removal makes bipartite. Došlić–Vukićević conjecture. They…