Search papers, labs, and topics across Lattice.
Affiliation:
1
0
Orthogonal polarity graphs uniquely maximize spanning tree complexity under girth-4 constraints, proving London's conjecture for almost all prime-power orders.