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...
Description In Coding Theory, the maximum size of binary codes of length n with minimum distance d is a well studied problem. In this talk, we study binary codes when there is a restriction on maximum...
Description The nontrivial lower bounds of the spectral gap for discrete Laplacian of the basis-exchange graph of a Matroid have algorithmic importance. First, we will present some background...
Description The nontrivial lower bounds of the spectral gap for discrete Laplacian of the basis-exchange graph of a Matroid have algorithmic importance. In the first part of this presentation, we will...
Description The nontrivial lower bounds of the spectral gap for discrete Laplacian of the basis-exchange graph of a Matroid have algorithmic importance. In the first part of this presentation, we will...
Saturation number and induced Saturation number Description Arturo Jurado Open Problems: Zero Forcing Sets and Propagation Time Yunjiao Liu Open Problems: Saturation number and induced Saturation...
Description Chris Mitillos : Ore's Conjecture - edge bounds on k-critical graphs Gergely Balint : Extremal problems on Graph Homomorphisms - fix a graph H, what graphs G maximize the number of...
Open Problems Description Crossing Numbers : Introduction to topological graph theory - how to distinguish between the 'independent odd crossing number' and the 'odd crossing number'. Open Problems...
