Math Explorers Club
Math Explorers Club
Graphs, Partially Ordered Sets and Polynomials
Tuesday, January 27, 2009
We will approach “graphs and polynomials” in three ways - the first, and easier, will be to show how given a bunch of polynomials (or just natural numbers), we can make a graph that represents their least common multiples. This is a very special type of graph called a “partially ordered set” or “poset” for short. Posets occur in the natural world with an incredible frequency.








Exercise: Draw the lcm poset for the numbers 2,4,8 and 5.
The second way we’ll run into polynomials will be to actually represent the edges of our graph as polynomials of degree two, and consider how many different polynomials we can make as sums or multiples of these. Given a graph, there is a special set of polynomials we can associate to it called its “edge ideal,” an object that numerous combinatorialists across the world study to this day.
The third will be to consider a number of different polynomials associated with graphs. Combinatorialists that study graphs will often use these polynomials to give them information about the graphs they are studying - for example, even if calculating whether two graphs are really the same graph (“isomorphic”), sometimes it’s easier to calculate one of these special polynomials associated to each of the graphs and check and see if they are the same. While having the same polynomial may or may not mean that they are isomorphic, having different polynomials would indicate they were different graphs.
Let’s go to our third set of polynomials. The easiest one to calculate is the only one we’ll focus on today - it’s called the “Tutte polynomial.”