2 problems
- 0 votes0 replies1 view
Lexicographically least extremal permutation conjecture
Let be prime, and define a permutation of by … Order permutations lexicographically, and let be the minimum number of collinear triples in a permu…
- 0 votes0 replies2 views
The upper-bound conjecture for collinear triples in permutation graphs
Let be prime, and let denote the minimum number of collinear triples in the graph of a permutation of in . The preceding bounds…