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...
Speaker Marcus Schaefer CTI, Depaul University http://ovid.cs.depaul.edu/ Description We show that for every n there are two simple curves on the torus intersecting at least n times without the two...
Description For a finite poset P = ( X, ) the fractional weak discrepancy (denoted by wd F(P)) is defined as the minimum value t for which there is a function f: X → R such that (1) f( x) + 1 ≤ f( y)...
Speaker Janos Pach Courant Institute, NYU http://www.math.nyu.edu/~pach/ Description For d > 2 and n > d+1, let P = { p 1, . . . , p n } be a set of points in R d whose convex hull contains the origin...
Description Given a set of integers D, a D-diffsequence is a combinatorial object closely related to arithmetic progressions. It is defined to be any sequence a(1), a(2), ..., a(n) such that the...
