6 problems
Let be a minimally 3-rigid graph, and let be obtained from by a 1-extension of type E2Xs511 or E2Vs511. Let denote the three-dimensional realizatio…
Let be a minimally 3-rigid graph, and let be obtained from by a 1-extension of type E1s63. Let denote the three-dimensional realization count. The…
Let be a minimally rigid graph, and let be obtained from by a 1-extension of type E1a. Let denote the spherical realization count. The sphe…
Let be a minimally rigid graph, and let be obtained from by a 1-extension of type E1a. Let denote the planar realization count. The planar E1a doub…
Edge-disjoint 1-factor conjecture. Some realization of has edge-disjoint -factors if and only if
Let and denote the maximum numbers of realizations in dimensions and , respectively, among Laman graphs with vertices. For each , let…