Feeds:
Posts
Comments

Archive for the ‘combinatorics’ Category

Kriesell’s Conjecture

Posted in combinatorics, graph theory on June 15, 2011 | Leave a Comment »

Today’s short post is about Kriesell’s conjecture. In my first year of PhD I enjoyed reading several papers related to this cute conjecture. Nash-Williams [N'61] and Tutte [Tutte'61] independently proved that a graph has edge-disjoint spanning trees if and only if for every partition of into non-empty classes, where denotes the number of edges connecting [...]

Read Full Post »

Open Problems from FOCS 2009

Posted in algorithms, combinatorics, complexity, conferences, graph theory, tagged , , , , on November 9, 2009 | 2 Comments »

Here are some open problems (that interest me) from FOCS 2009. If you want to share an open problem, please leave a comment. Starting with my paper……. 1) Reducibility Among Fractional Stability Problems [pdf] Shiva Kintali, Laura Poplawski, Rajmohan Rajaraman, Ravi Sundaram and Shang-Hua Teng. Summary : We resolve the computational complexity of a number [...]

Read Full Post »

Follow

Get every new post delivered to your Inbox.