Austin Mohr
|
Registered User
|
Status
Fifth-year Ph.D. candidate working in combinatorics under László Székely at University of South Carolina Columbia. Interests Combinatorics, general topology, and mathematical pedagogy. Currently Researching Applications of the Lopsided Lovász Local Lemma. Spacebook Spacebook is a searchable database of topological spaces and their properties (in ZFC) inspired by Steen and Seebach’s Counterexamples in Topology. (Learn more.) |
|
May 13 |
awarded | ● Popular Question |
|
Feb 15 |
comment |
Number of spanning subgraphs of the complete bipartite graph K(m,n) If you are indeed interested in just spanning trees of $K(m,n)$, then you may find more information at www.austinmohr.com/work (under "Master's Thesis"). Moreover, the algorithm used to enumerate the trees should be easy to adapt to counting any sort of subgraph, though the runtime will suffer. There is a polytime algorithm for determining isomorphism between trees, but there is not yet one for general graphs. |
|
Nov 22 |
comment |
How To Present Mathematics To Non-Mathematicians? If you start with the phrase "Rational Points on Atkin-Lehner Quotients of Shimura Curves" and remove all the words the medical student did not know, you are left with "Points on of Curves" - almost precisely what he echoed back to you. :) |

