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...
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
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...
Event Topic Discrete Applied Math Seminar
