USING COMBINATORICA/MATHEMATICA FOR STUDENT PROJECTS IN RANDOM GRAPH THEORY
Thomas J. Pfaff, Michele Zaret · PRIMUS · 2006
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.