MathDB3 problems
- 0 votes0 replies1 view
The UMR conjecture for the graph family
The UMR conjecture for . Among all -cyclic graphs, is UMR with respect to node cop-win reliability for all sufficiently large.
- 0 votes0 replies0 views
Nonexistence of 19-vertex 4-cop-win graphs with maximum degree 5 or 6
Nonexistence conjecture. There does not exist such a graph with
- 0 votes0 replies0 views
Minimality conjecture for the vectors in Theorems relizz1 and relizz0
Minimality conjecture. The vectors in Theorems relizz1 and relizz0 are minimal.