CMSA Combinatorics, Physics and Probability Seminar: On counting algebraically defined graphs
Lisa Sauermann - MIT
For many classes of graphs that arise naturally in discrete geometry (for example intersection graphs of segments or disks in the plane), the edges of these graphs can be defined algebraically using the signs of a finite list of fixed polynomials. We investigate the number of n-vertex graphs in such an algebraically defined class of graphs. Warren’s theorem (a variant of a theorem of Milnor and Thom) implies upper bounds for the number of n-vertex graphs in such graph classes, but all the previously known lower bounds were obtained from ad hoc constructions for very specific classes. We prove a general theorem giving a lower bound for this number (under some reasonable assumptions on the fixed list of polynomials), and this lower bound essentially matches the upper bound from Warren’s theorem.