{"id":3,"date":"2023-02-24T15:28:50","date_gmt":"2023-02-24T15:28:50","guid":{"rendered":"https:\/\/www.dawsoncollege.qc.ca\/montreal-graph-theory-workshop\/home\/"},"modified":"2023-06-12T14:53:55","modified_gmt":"2023-06-12T18:53:55","slug":"home","status":"publish","type":"page","link":"https:\/\/www.dawsoncollege.qc.ca\/montreal-graph-theory-workshop\/","title":{"rendered":"MGTW23"},"content":{"rendered":"

The Montreal Graph Theory Workshop is an informal and friendly research workshop, where people can exchange ideas and pursue new research ideas while learning about recent developments or forgotten conjectures which deserve attention.<\/p>\r\n

The 2023 edition continues in the tradition of arguably the first iteration of the workshop in 2017, entitled Beauty of Discrete Mathematics<\/strong>.<\/a> Participation is by invitation only. All invited participants are encouraged, but not required, to give talks of lengths either 20 minutes or 40 minutes. Given the nature of the workshop, we especially encourage talks which promote future research. The structure of the week-long workshop will include ample time to conduct research in self-directed groups.<\/p>\r\n

The conference photo and available slides from the talks listed below can be accessed by participants through the link shared by email.<\/p>\r\n

Dates<\/h3>\r\n

The workshop will be held May 29 – June 2, 2023<\/strong>.<\/p>\r\n

Location<\/h3>\r\n\r\n\r\n\r\n

The workshop will be held at Dawson College, centrally located at the edge of downtown Montreal. It is easily accessible by Metro (Station Atwater, which provides direct access to the college from the station platform) and by bus (many routes have nearby stops, notably line 24 from downtown).<\/p>\r\n

Directions: Google Maps<\/a><\/p>\r\n\r\n\r\n\r\n

Confirmed participants<\/h3>\r\n

This list will continue to be updated as participants confirm their attendance.<\/p>\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n
\r\n
Name<\/b><\/div>\r\n<\/th>\r\n
\r\n
Affiliation<\/b><\/div>\r\n<\/th>\r\n
\r\n
Talk<\/b><\/div>\r\n<\/th>\r\n<\/tr>\r\n
Beaton, Iain<\/td>\r\nAcadia University, Canada<\/td>\r\nDomination critical vertices\u00a0<\/td>\r\n<\/tr>\r\n
Bernshteyn, Anton<\/td>\r\nGeorgia Institute of Technology, USA<\/td>\r\nBorel line graphs<\/td>\r\n<\/tr>\r\n
Bonato, Anthony<\/td>\r\nToronto Metropolitain University, Canada<\/td>\r\nThe Localization Game<\/td>\r\n<\/tr>\r\n
Clarke, Nancy<\/td>\r\nAcadia University, Canada<\/td>\r\n\u00a0<\/td>\r\n<\/tr>\r\n
Collins, Karen<\/td>\r\nWesleyan University, USA<\/td>\r\nPartitions of the Split Block Lattice<\/td>\r\n<\/tr>\r\n
Ellingham, Mark<\/td>\r\nVanderbilt University, USA<\/td>\r\nEven cycles through specified vertices<\/td>\r\n<\/tr>\r\n
Fujisawa, Jun<\/td>\r\nKeio University, Japan<\/td>\r\nRemoval of subgraphs and perfect matchings in graphs on surfaces<\/td>\r\n<\/tr>\r\n
Hahn, Ge\u0148a<\/td>\r\nUniversit\u00e9 de Montr\u00e9al, Canada<\/td>\r\n\u00a0<\/td>\r\n<\/tr>\r\n
Haxell, Penny<\/td>\r\nUniversity of Waterloo, Canada<\/td>\r\nOn \u0394-critical graphs<\/td>\r\n<\/tr>\r\n
Kardo\u0161, Franti\u0161ek<\/td>\r\nUniversit\u00e9 Bordeaux 1, France<\/td>\r\nNew reducible configurations for Barnette’s conjecture<\/td>\r\n<\/tr>\r\n
Kingan, Sandra<\/td>\r\nBrooklyn College, City University of New York, USA<\/td>\r\nDeletable edges in 3-connected graphs<\/td>\r\n<\/tr>\r\n
Lafond, Manuel<\/td>\r\nUniversit\u00e9 de Sherbrooke, Canada<\/td>\r\nOn the characterization of pairwise comparability graphs<\/td>\r\n<\/tr>\r\n
Lesniak, Linda<\/td>\r\nWestern Michigan University, USA<\/td>\r\nOn the necessity of Chv\u00e1tal’s hamiltonian degree condition and other forcibly P degree conditions<\/td>\r\n<\/tr>\r\n
Luo, Rong<\/td>\r\nWest Virginia University, USA<\/td>\r\nInteger flows of signed graph<\/td>\r\n<\/tr>\r\n
Maezawa, Shunichi<\/td>\r\nToyko University of Science, Japan<\/td>\r\nRainbow spanning tree reconfiguration<\/td>\r\n<\/tr>\r\n
Marshall, Emily<\/td>\r\nArcadia University, USA<\/td>\r\n\u00a0<\/td>\r\n<\/tr>\r\n
Meger, Erin<\/td>\r\nQueens University, Canada<\/td>\r\nDecomposing forbidden minors in the game of cops and robbers<\/td>\r\n<\/tr>\r\n
Messinger, Margaret-Ellen<\/td>\r\nMount Allison University, Canada<\/td>\r\nThe damage number of graphs<\/td>\r\n<\/tr>\r\n
Ndiaye, Ndiam\u00e9<\/td>\r\nMcGill University, Canada<\/td>\r\n\u00a0<\/td>\r\n<\/tr>\r\n
Norin, Sergey<\/td>\r\nMcGill University, Canada<\/td>\r\nBurning large trees<\/td>\r\n<\/tr>\r\n
Ozeki, Kenta<\/td>\r\nYokohama National University, Japan<\/td>\r\nH<\/em>-coloring of 4-regular graphs<\/td>\r\n<\/tr>\r\n
Paardekooper, Victor<\/td>\r\nUniversit\u00e9 de Montr\u00e9al, Canada<\/td>\r\n<\/td>\r\n<\/tr>\r\n
Seamone, Ben<\/td>\r\nUniversit\u00e9 de Montr\u00e9al and
Dawson College, Canada<\/td>\r\n		<\/td>\r\n<\/tr>\r\n
Shan, Songling<\/td>\r\nIllinois State University, USA<\/td>\r\nGraph edge coloring and the Overfull Conjecture<\/td>\r\n<\/tr>\r\n
Shantanam, Abhinav<\/td>\r\nSimon Fraser University, Canada<\/td>\r\nPancyclicity in 4-connected planar graphs<\/td>\r\n<\/tr>\r\n
Tabarelli, Gloria<\/td>\r\nUniversity of Verona, Italy<\/td>\r\nSome results on the palette index of graphs<\/td>\r\n<\/tr>\r\n
Trenk, Ann<\/td>\r\nWellesley College, USA<\/td>\r\nSplit Graphs and Block Representations<\/td>\r\n<\/tr>\r\n
Turcotte, J\u00e9r\u00e9mie<\/td>\r\nMcGill University, Canada<\/td>\r\nFinding dense minors using average degree<\/td>\r\n<\/tr>\r\n
Vetta, Adrian<\/td>\r\nMcGill University, Canada<\/td>\r\n\u00a0<\/td>\r\n<\/tr>\r\n
West, Douglas B.<\/td>\r\nU. Illinois at Urbana-Champaign, USA;
Zhejiang Normal U., PR China<\/td>\r\n		Sharp lower bounds for the number of maximum matchings in bipartite multigraphs<\/td>\r\n<\/tr>\r\n
Zamfirescu, Carol T.<\/td>\r\nGhent University, Belgium<\/td>\r\n\u00a0<\/td>\r\n<\/tr>\r\n<\/tbody>\r\n<\/table>\r\n

Registration<\/h3>\r\n\r\n\r\n\r\n

For registration information, please refer to the email sent by the organizers. If you do not have this information, please contact the organizers. The registration fee covers attendance at the event, all morning\/afternoon coffee breaks, and the conference dinner (May 31, 2023, at La Prunelle<\/a>).<\/p>\r\n\r\n\r\n\r\n

Accommodation<\/h3>\r\n\r\n\r\n\r\n

Preferred rates are available to workshop attendees at the nearby Hotel 2170<\/a>. Studios with one queen bed (max 2 occupants) are available for $149\/night plus applicable taxes. This rate includes internet access and a buffet breakfast. Participants may book rooms directly through the hotel’s website or by phone (1-800-678-6323) but will require a code to receive the discounted rate<\/span>. Please contact the conference organizers if you do not have the code. Note that the preferred rate is available only to those who book no later than May 1, 2023<\/strong>.<\/p>\r\n

Dawson College is conveniently located in relation to Montreal’s subway system (Metro), so any accommodations in downtown Montreal are worth considering through the usual booking sites. Note that some Montreal hotels now give better rates when booking with them directly.<\/p>\r\n\r\n\r\n\r\n\r\n\r\n

About the city<\/h3>\r\n\r\n\r\n\r\n

Montreal is a vibrant tourist destination year-round, but is especially pleasant during summer months. Here are some links which you may find relevant during your stay.<\/p>\r\n\r\n\r\n\r\n