Spring 2007

Friday (April 6) 10:00-11:00 am, Alavi Commons Room

Professor Andrew Woldar

Coordinatized Graphs: General Theory and Properties


Graphs CD(n.q) were constructed to solve a specific class of extremal problems (graphs with many edges and large girth). However, it soon became apparent that these graphs had more intriguing properties than we had anticipated. On closer examination, we discovered that the majority of these properties depended less on the actual graph definitions and more on our "mode" of definition. This prompted us to generalize our construction to what we here call "coordinatized graphs." In our talk We discuss several properties of these graphs, and speculate on their potential significance. (Joint work with F.Lazebnik)