I realized shortly after writing yesterday’s post about using
gtools that I did not properly explain the piping procedure for
geng. To remedy that deficiency, I will provide a concrete example of how I used this method in actual research.
In this example, we will exactly characterize the infinite class of -extremal graphs for . We’ll start by talking about the mathematics, and at the very end we will go into the concrete piping example. Theoretically, you could skip straight to the code, but you’ll miss out on the fact that the computer is simultaneously discovering and proving a structure theorem for an infinite class of graphs!
Read the rest of this entry »