Monotone graph properties
University of Miami
refreshments at 3:45pm
A monotone graph property is a collection of graphs
on a fixed, labeled vertex set V which is closed under removal
of edges and permutation of vertices. Each monotone graph
property determines a simplicial complex whose vertices correspond
to the edges in the complete graph on V. The topological structure
of such complexes was first investigated by J. Kahn, M. Saks
and D. Sturtevant in their study of computational complexity of
monotone graph properties. More recently, certain classes of
monotone graph properties have appeared in various areas of
algebra, topology and combinatorics. I will discuss some of
these classes and the techniques used to investigate them.
Speaker's Contact Info: shareshi(at-sign)math.miami.edu
Return to seminar home page
Page loaded on November 20, 2000 at 10:58 AM.
Copyright © 1998-99, Sara C. Billey.
All rights reserved.