Speaker Dan Cranston Virginia Commonwealth University http://www.people.vcu.edu/~dcranston/ Description Let G be a graph with maximum degree Δ ≥3. Brooks' Theorem says that if G has chromatic number Δ...
Speaker Robert Ellis IIT Applied Math http://math.iit.edu/~rellis/ Description The point of group testing is to reduce the cost of finding defective items in a population by testing pools if items...
Description The crossing number of a graph $G$, $\crs(G)$ is the minimum number of intersections among edges over all possible drawings on a plane. The pairwise crossing number $\pcr(G)$ is the...
Properly colored copies and rainbow copies of large graphs with small maximum degree Description Counting Independent sets up to tree threshold : We consider the problem of counting a given weighted...
A Polynomial Approximation to the Matrix Permanent via Markov Chain Monte Carlo. Description Algorithms for the Min-Cut problem : The project will discuss the Min-Cut problem, and introduce some...
Subgraphs of random graphs with specified degrees Description Improved Bounds on Coloring of Graphs : This paper by Sokol Ndreca, Aldo Procacci, Benedetto Scoppola (2011) has several improvements on...
Propagation of Information in a Network Description Cardinality of 2 and Higher Distance Sets: This presentation focuses on an improved upper bound on the cardinality of a 2-distance set proved by...
Description The area of non-adaptive group testing is a well-sought topic in recent years. The general problem is - we have a large set of elements, N which contains some 'special items'. The (sub)set...
On Counting Weighted Graph Homomorphisms Description Coloring Nonuniform Hypergraphs: A New Algorithmic Approach to the General Lovasz Local Lemma : The Lovasz Local Lemma is a useful tool for making...
Description Attacker defender games are (two-player) games played on graphs. The player strategies are subsets of the edges or vertices of the graph (for example the defender sends message(s) through...
