Mar
8
Attacker Defender Games
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...
Events Archive
Find an Event
Currently selected filters
- Discrete Applied Math Seminar
Mar
1
Codes with bounded distances, and their applications to distance graphs
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...
Feb
22
Matroid Expansion Conjecture: An Eigenvalue Approach
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...
Nov
7
Eigenvalues, Matroids and Graphs: Part II
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...
Oct
31
Eigenvalues, Matroids and Graphs: Part I
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...
Oct
24
Zero Forcing Sets and Propagation Time
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...
Oct
17
Open Problems
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...
Oct
3
Crossing Numbers
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...
Sep
19
Progress in Fall Coloring of Graph
Description Chris will present a compendium of his results on Fall coloring in preparation for his talk at MIGHTY conference. Event Topic Discrete Applied Math Seminar
Sep
5
Progress in Polynomial Identity Testing
Description Jinyu will present an algebraic problem in algorithm design and complexity theory : the Polynomial Identity Testing (PIT) problem: given a multivariate polynomial over a field, determine...