MathDB5 problems
- 0 votes0 replies1 view
Positive-speed conjecture for infection on Sierpiński gaskets and carpets
Let the infection process and its Lipschitz cutset be as defined in the paper, and let denote the first spatial level intersected by the cutset. The cutset retains the Lipsch…
- 0 votes0 replies0 views
Maximum vertex-periodicity conjecture for fractal graphs
Maximum periodicity conjecture. The maximum periodicity of any vertex in each listed fractal graph is given by the corresponding value above.
- 0 votes0 replies1 view
Anema's conjectures on asymptotic complexity of fully symmetric fractal graphs
Anema's conjectures. Adding the assumption of full symmetry should allow one to prove, using the spectrum of the probabilistic graph Laplacian, the existence of the asymptotic comp…
- 0 votes0 replies0 views
Convergence conjecture for spanning-tree complexity on fully symmetric fractals
Convergence conjecture. The limit
- 0 votes0 replies0 views
Conjecture that connected spanning subgraphs outnumber spanning forests on generalized Sierpinski gaskets
Connected-spanning-subgraph inequality. The inequality