Graphs at Ryerson (G@R)

Graphs @ Ryerson (G@R) is a group of researchers and students interested in pure and applied graph theory, and is housed in the Department of Mathematics at Ryerson University. G@R runs a regular seminar series given by its members and visitors.

Members:

Faculty: Dr. Anthony Bonato, Dr. Dejan Delić, Dr. Peter Danziger, Dr. Eric Mendelsohn, Dr. Pawel Pralat, Dr. Changping Wang

Post-doctoral fellows: Dr. Andrea Burgess, Dr. Dieter Mitsche

Graduate students: Ali Haidar, Nevena Francetić, Muhanda Stella Mbaka Muzala, Vivija Ping You

Past post-doctoral fellows: Dr. Graeme Kemkes, Dr. Margaret-Ellen Messinger, Dr. Changping Wang

Past graduate students: Liam Baird, Tamar Krikorian, Amanda Tian

Photo of G@R members, May 2012.

Photo of G@R members, April 2011.

Photo of G@R members, March 2010.

---

Upcoming Seminars (Winter 2012): Seminars usually take place in ENG210, on Thursdays at 10:30am.

31) May 24: Jason Brown, Network Reliability

30) May 3: Pawel Pralat, This year puzzles!

29) April 19: Andrea Burgess, Cops and robbers on graphs based on designs

28) April 5: Abbas Mehrabian, On the density of nearly regular graphs with a good edge-labelling

27) March 22: Peter Danziger, Infinitely Resolvable Designs

26) March 8: Dieter Mitsche, Cops and invisible robbers: the cost of drunkenness

25) February 16: Robert Bailey, The metric dimension problem

24) February 9: Steve Chaplick, Path Graphs and PR-trees

---

Past Seminars (2011)

23) November 24: Mike Molloy, Frozen vertices in colourings of a random graph

22) November 3: Andrea Burgess, Near factorizations of complete graphs

21) October 20: Steve Chaplick, Path Graphs and PR-trees (talk postponed, Pawel Pralat talked instead)

20) October 13: Dejan Delic, Reduction of CSP Dichotomy to Digraphs - Part II

19) September 29: Dejan Delic, Reduction of CSP Dichotomy to Digraphs - Part I

18) September 15: Anthony Bonato, Problems and conjectures on Cops and Robbers

17) May 12: Tamar Krikorian, OA's, OOA's, OCA's and MOCA's

16) April 14: Liam Baird, Meyniel extremal families of graphs

15) Friday, March 25, 10 am: Richard Nowakowski, A survey on the search for well-covered atoms

14) March 10: Andrea Burgess, Generalized packing designs

13) January 27: Nevena Francetić, Covering arrays with row limit

12) January 13: Dejan Delic, Tree dualities and orderings on oriented trees

---

Past Seminars (2010)

11) November 26: Pawel Pralat, Meyniel's conjecture holds for random graphs

10) November 2: Changping Wang, Orthogonal (g,f)-factorizations in graphs

9) October 19: Peter Danziger, The Oberwolfach and related problems

8) October 5: Graeme Kemkes, Random regular graphs

7) September 21: Anthony Bonato, Graph densities

6) March 30: Pawel Pralat, Graphs with average degree smaller than 30/11 are burning slowly

5) March 16: Dejan Delic, Homomorphism Testing Strategies For Finite Digraphs

4) March 2: Changping Wang, Some Problems on Domination

3) February 9: Peter Danziger, MOLS: Bachelors and Monogamous Mates

2) January 26: Margaret-Ellen Messinger, Cleaning A Network with Mechanized Brushes

1) January 12: Anthony Bonato, Meyniel's Conjecture

---

G@R members are supported by NSERC, MITACS, and SHARCNET.