THIS SITE

Information for

You are here

Ahmad Abdi awarded a 2018 Huawei Prize

Monday, April 23, 2018

Huawei

C&O PhD student Ahmad Abdi is a recipient of the 2018 Huawei Prize. This award provides $4,000 to a graduate student in the Faculty of Mathematics for demonstration of outstanding achievement in research through a peer-reviewed paper.

Ahmad was nominated for his paper "Packing odd T-joins with at most two terminals" (also available here), published in the Journal of Graph Theory and co-authored with his advisor, Professor Bertrand Guenin. An abbreviated version of  the paper had appeared in the proceedings of the IPCO 2014 conference.
 
Ahmad's paper proves an important special case of Paul Seymour's celebrated Cycling Conjecture. This conjecture, first proposed in 1977, is widely considered as one of the most challenging and fundamental problems in the area of combinatorial optimization. The conjecture posits that binary Eulerian matroids for which the cut condition holds but which do not have an integer flow must contain one of four possible obstructions. This conjecture has far reaching consequences, including generalizations of the four-colour theorem such as Tutte's 4-flow conjecture.

Ahmad's paper proves the Cycling Conjecture for the class of even cycle matroids -- binary matroids that can be obtained as lifts of graphic matroids. The proof uses novel and powerful techniques, as well as tools from matroid theory, graph connectivity, and topological graph theory.

  1. 2018 (11)
    1. May (2)
    2. April (3)
    3. March (1)
    4. February (1)
    5. January (4)
  2. 2017 (16)
    1. November (1)
    2. October (2)
    3. September (4)
    4. July (1)
    5. May (2)
    6. April (2)
    7. March (1)
    8. February (2)
    9. January (1)
  3. 2016 (22)
    1. November (2)
    2. October (2)
    3. September (5)
    4. August (1)
    5. July (2)
    6. June (2)
    7. May (2)
    8. April (4)
    9. February (1)
    10. January (1)
  4. 2015 (26)
  5. 2014 (25)
  6. 2013 (13)
  7. 2012 (12)
  8. 2011 (9)
  9. 2010 (5)
  10. 2009 (5)
  11. 2008 (2)
  12. 2007 (1)
  13. 2006 (4)
  14. 2005 (6)
  15. 2003 (1)
  16. 2002 (2)
  17. 2001 (2)