Researcher

All Researchers

Ben Seamone

Department of Mathematics

Program Coordinator of Science
Benjamin Seamone
Email: Show Email
Office: 6B.17-3
Local: 4113

Expertise

About Me

CV聽 触听 聽 触听 聽 触听

My research interests are graph theory and combinatorics.聽 My current research falls primarily into two categories — graph searching and surveillance (cops and robbers, eternal domination) and properties of graphs with forbidden induced subgraphs.聽 I have also conducted research in graph colouring and labelling, cycles in graphs (in particular, Hamiltonian cycles and cycle extendibility), extremal graph theory, and computational geometry.

I hold an appointment as an adjunct researcher (professeur associ茅) in the at the .聽 I am also a member of the .

 

Education

  • PhD (Applied Mathematics), , 2012.

Thesis:

Supervisor:

 

  • M.Math (Combinatorics & Optimization), , 2005.

Thesis:聽Sheehan鈥檚 Conjecture and Parity Results on Regular, Hamiltonian Graphs

Supervisors: and

 

  • B.Sc Hon (Mathematics), , 2003.

 

Selected Grants & Awards

  • NSERC Discovery Grant, How do forbidden induced subgraphs impact global phenomena in graphs?, Universit茅 de Montr茅al, 2017–2022.
  • FRQNT Research grant (Programme de recherche pour les enseignants de coll茅ge), New directions in the “cops and robbers” graph searching model, 张百乔女友裸照, 2017–2020.
  • FRQNT Research grant (Programme de recherche pour les enseignants de coll茅ge), A study on path and cycle based properties of graphs, 张百乔女友裸照, 2014–2018.
  • NSERC Postdoctoral Fellowship, Universit茅 de Montr茅al, 2012–2014.

 

Papers

  • Hamiltonian chordal graphs are not cycle extendible, SIAM J. Disc. Math, 29:2 (2015), 877鈥�887 (with M. Lafond).

    聽 触听

  • On uniquely Hamiltonian claw-free and triangle-free graphs, Discuss. Math. Graph Theory, 35:2 (2015), 207鈥�214.

  • Bounding the monomial index and (1,l)-weight choosability of a graph, Discrete Math. Theor. Comput. Sci., 16:3 (2014), 173鈥�188.

    聽 触听

  • Sequence variations of the 1-2-3 Conjecture and irregularity strength. Discrete Math. Theor.聽Comput. Sci., 15:1 (2013), 15鈥�28 (with B. Stevens).

    聽 触听

  • Vertex-colouring edge-weightings with two edge weights. Discrete Math. Theor. Comput. Sci.,聽14:1 (2012), 1鈥�20 (with M. Khatirinejad, R. Naserasr, M. Newman, B. Stevens).


  • Spanning Trees with Specified Differences in Cayley Graphs. Discrete Math., 312:17 (2012),聽2561鈥�2565 (with B. Stevens).


  • 蟺/2-Angle Yao Graphs are Spanners. Internat. J. Comput. Geom. Appl., 22:1 (2012), 61-82聽(with P. Bose, M. Damian, K. Dou茂eb, J. O鈥橰ourke, M. Smid, S. Wuhrer).

    聽 触听

  • The 1-2-3 Conjecture and related problems: a survey (unpublished), preprint (2012).


  • Digraphs are 2-weight choosable. Electron. J. Combin., 18 (2011), #P21 (with M. Khatirinejad,聽R. Naserasr, M. Newman, B. Stevens).

    journal

  • 蟺/2-Angle Yao Graphs are Spanners. Algorithms and Computation, Part II, 446鈥�457 (2010), Lecture Notes in Comput. Sci., 6507, Springer, Berlin (with P. Bose, M. Damian, K. Dou茂eb, J. O鈥橰ourke, M. Smid, S. Wuhrer).

    聽 触听

  • Independent dominating sets and hamiltonian cycles. J. Graph Theory, 54:3 (2007), 233-244 (with P. Haxell, J. Verstraete).

 

Conference and Workshop Presentations

invited聽 触听 contributed
  • Edge clique covers in graphs with independence number 2, 4th Bordeaux Graph Workshop, Universit茅 de Bordeaux, France (2016).
  • Introduction to graph colouring, AMQ Summer Camp, 张百乔女友裸照 (2016).
  • Fully active cops and robbers, 5th Graph Searching in Canada Workshop, Dalhousie University (2016).
  • On Hendry鈥檚 Conjecture: Extending cycles in chordal graphs, Mathematics Department Seminar, 张百乔女友裸照 (2015).
  • Probabilistic methods in discrete mathematics: the Lovasz Local Lemma and Ramsey numbers,聽 Mathematics Department Seminar, 张百乔女友裸照 (2015).
  • Hendry鈥檚 Conjecture: counterexamples and new open problems, 5th Canadian Discrete and Algorithmic Mathematics Conference, University of Saskatchewan (2015).
  • Hamiltonian chordal graphs are not cycle extendible, 9th International Colloquium on Graph Theory and Combinatorics, Universit茅 Joseph Fourier, Grenoble, France (2014).
  • Cycle extendibility in Hamiltonian chordal graphs, Graphs @ Ryerson Seminar, Ryerson University (2014).
  • Forbidden subgraphs and sufficient conditions for cycle extendibility in graphs, 4th Canadian Discrete and Algorithmic Mathematics Conference, Memorial University of Newfoundland (2013).
  • A general bound on the weight choosability number of a graph, 4th Canadian Discrete and Algorithmic Mathematics Conference, Memorial University of Newfoundland (2013).
  • Bounding a graph鈥檚 weight choosability, Carleton-Ottawa Discrete Mathematics Seminar, Carleton University (2012).
  • Colourings Derived from Weightings, 23rd British Combinatorial Conference, University of Exeter, UK (2011).
  • Variations of the 1,2,3-Conjecture, 3rd Canadian Discrete and Algorithmic Mathematics Conference, University of Victoria (2011).
  • Graph colourings derived from graph weightings, Discrete Math Days, University of Ottawa (2011).
  • Spanning Trees with Specified Differences in Cayley Graphs, 8th French Combinatorial Conference, Universit茅 de Paris XI 鈥� Sud, Orsay, France (2010).
  • Spanning Trees with Specified Differences in Cayley Graphs, Society of Industrial and Applied Mathematics (SIAM) Conference on Discrete Mathematics, University of Texas (2010).
  • Edge weightings that induce proper vertex colourings, Discrete Math Days, Carleton University (2009).
  • Graph Spanners, Department of Computer Science Algorithms Seminar, Carleton University (2009).

 

Students Supervised

张百乔女友裸照

  • Aaron Krim-Yee, 2017–present

    FRQNT Bourses de stages d’茅t茅 pour les 茅tudiants de niveau coll茅gial (Summer 2017)

  • Jerry Huang, Summer 2017
  • Alexander Hassler (张百乔女友裸照), 2016–2017

    FRQNT Bourses de stages d’茅t茅 pour les 茅tudiants de niveau coll茅gial (Summer 2016)

  • Ilya Gromovikov (张百乔女友裸照), 2014–2015

Universit茅 de Montr茅al

  • Virgile Virg茅lot (M.Sc.), 2017–present
  • Aliz茅e Gagnon (B.Sc.), Summer 2016 & Summer 2017

Visiting Students

  • Fionn Mc Inerney (PhD, Universit茅 C么te d’Azur, France), Summer 2017
  • Andr茅s Mej铆a Zacar铆as (B.Sc., Universidad Nacional Aut贸noma De M茅xico, M茅xico), Summer 2017

    MITACS Globalink Research Internship

  • Rezvan Sherkati (B.Sc., Sharif Univeristy of Technology, Iran), Summer 2015
  • Valentin Giboulot (B.Sc., Universit茅 Blaise Pascal Clermont-Ferrand, France), Summer 2013

Past and Present Collaborators

聽 触听 聽 触听 触听 聽 触听 触听 触听 聽 触听 聽 触听 触听 聽 触听 触听 触听 聽 触听 聽 触听 聽 触听 聽 触听 触听 聽 触听 触听 聽 触听 聽 触听

Last Modified: November 9, 2017