Using combinatorica/mathematica for student projects in random graph theory
We give an example of a student project that experimentally explores a topic in random graph theory. We use the Combinatorica package in Mathematica to estimate the minimum number of edges needed in a random graph to have a 50 percent chance that the graph is connected. We provide the Mathematica code and compare it to the known theoretical result. © 2006 Taylor & Francis Group, LLC.
Pfaff, Thomas J. and Zaret, Michele, "Using combinatorica/mathematica for student projects in random graph theory" (2006). Faculty Articles Indexed in Scopus. 1873.