[Nauty] Re: projective planes (correction)

[Mark Goldberg]

Here is the exact formulation of Bruck's theorem which can be used
to construct an O(n^{log log n}) algorithm for constructing a
canonical vertex numbering of the graph of a projective plane:


Let $\Phi$ be a subplane of a finite projective plane $\Psi$, and let
the orders of $\Phi$ and $\Psi$ be $m$ and $n$ respectively.
Then, either $\Phi = \Psi$, or $m^2 \leq n$, or $m^2 + m \leq n$.


-Mark