8 problems
- 0 votes0 replies1 view
Ábrego et al.'s 3-symmetric 3-decomposable optimal drawing conjecture
Ábrego et al.'s conjecture. For each positive integer multiple of , there is an optimal rectilinear drawing of that is 3-symmetric and 3-decomposable.
- 0 votes0 replies1 view
Conjecture that optimal point sets are 3-decomposable
3-decomposability conjecture. Every optimal set is 3-decomposable.
- 0 votes0 replies0 views
Conjecture on the asymptotic rectilinear crossing number of complete graphs
Asymptotic lower-bound conjecture. The rectilinear crossing number satisfies
- 0 votes0 replies1 view
Ábrego et al.'s minimum -edge conjecture for crossing-minimal drawings
Ábrego et al.'s conjecture. For each positive integer multiple of , all crossing-minimal geometric drawings of have exactly
- 0 votes0 replies0 views
Ábrego et al.'s 3-decomposability conjecture for crossing-minimal drawings
Ábrego et al.'s conjecture. For each positive integer multiple of , all crossing-minimal geometric drawings of are -decomposable.
- 0 votes0 replies0 views
The conjecture that every divisible-order complete graph has a 3-symmetric optimal drawing
3-symmetric optimal-drawing conjecture. For each positive integer divisible by , there is an optimal geometric drawing of that is 3-symmetric.
- 0 votes0 replies0 views
The conjecture that optimal rectilinear drawings of are 3-decomposable
3-decomposability conjecture. For each positive integer divisible by , all optimal rectilinear drawings of are 3-decomposable.
- 0 votes0 replies0 views
The conjecture that optimal drawings of are 3-decomposable and 3-symmetric
3-decomposability and symmetry conjecture. All optimal geometric drawings are 3-decomposable, and for every positive integer divisible by there is a 3-symmetric optimal con…