Apr
10
On Graph Fall-Colouring
Description Graph fall-colouring is an intersection of graph colouring and graph domination, whereby we attempt to partition a graph into independent dominating sets. In this talk, we will see various...
Events Archive
Find an Event
Currently selected filters
- Discrete Applied Math Seminar
Feb
24
Horn formulas and directed hypergraphs
Host Rob Ellis Speaker Gyorgy Turan University of Illinois-Â鶹APP http://www.math.uic.edu/people/profile?netid=gyt Description A Horn formula in propositional logic is a set of rules of the form a,b...
Feb
17
The Majority-rule Paradigm in Supertree Construction
Host Department of Applied Math Speaker F.R. McMorris Professor Emeritus, IIT www.iit.edu/directory/people/fr-mcmorris Description The problem of aggregating the individual preferences of a group of...
Feb
6
A Proof of the Manickam-Miklós-Singhi Conjecture for Vector Spaces
Speaker Ameera Chowdhury Carnegie Mellon University http://www.math.cmu.edu/~ameera/ Description A Proof of the Manickam-Miklós-Singhi Conjecture for Vector Spaces Event Topic Discrete Applied Math...
Nov
6
Relay placement for two-connectivity
Speaker Gruia Calinescu IIT Computer Science http://www.cs.iit.edu/~calinesc/ Description Motivated by applications to wireless sensor networks, we study the following problem. We are given a set S of...
Oct
30
Planarities and Hanani-Tutte
Speaker Marcus Schaefer DePaul University http://ovid.cs.depaul.edu/ Description The beautiful (and old) Hanani-Tutte theorem states that a graph is planar if and only if it can be drawn so that any...
Oct
24
Algebraic and Geometric Ideas in Linear Optimization
Speaker Jesus De Loera Department of Mathematics University of California Davis https://www.math.ucdavis.edu/~deloera/ Description Linear programming is undeniably a central software tool of applied...
Oct
16
Location Functions on Trees and Beyond: A Short Survey and Some Recent Results
Description Let G =(V,E) be a finite connected graph and π a k-tuple in V. Think of k customers, each one reporting a most preferred vertex. Location and consensus theory often involves finding the...
Oct
1
Convex Geometries and The Copoint Graph
Description We introduce abstract convex geometries. Much as matroids can be thought of as "discrete vector spaces", convex geometries are "discrete convex hulls". There are specific convex sets of...
Sep
25
Non-Adaptive Group Testing
Description Group testing is a well researched and practically important topic (e.g. in biological research). The basic idea of group testing is to perfectly identify a small portion of 'special'...