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