Faculty Picture

Gabor Meszaros

Postdoc

Office
Dunn Hall 372

Research Interests

Combinatorics, Graph theory: disjoint path problems; graph products and parameter inheritance; combinatorial properties of zero-forcing and additional percolation models.

Publications

  1. A. Girão, G. Mészáros, S.G.Z. Smith, On a conjecture of Gentner and Rautenbach, Discrete Mathematics (2017), submitted.
  2. A. Girão, G. Mészáros, K. Popielarz, R. Snyder, On the maximum degree of path-pairable graphs, SIAM Journal on Discrete Mathematics (2017), submitted.
  3. A. Girão, G. Mészáros, K. Popielarz, R. Snyder, On the maximum diameter of path-pairable graphs, Discrete Mathematics (2017), submitted.
  4. A. Girão, G. Mészáros, An Improved Upper Bound on the Maximum Degree of Terminal-Pairable Complete Graphs, Discrete Mathematics (2017), submitted.
  5. A. Jobson, A.K. Kezdy, J. Lehel, G. Mészáros, On the Path-Pairability of the Cartesian Product of Stars, Discussiones Mathematicae Graph Theory (2016), submitted.
  6. D. Gerbner, B. Keszegh, G. Mészáros, B. Patkós, M.Vizer, Line Percolation in Finite Projective Planes, SIAM Journal on Discrete Mathematics (2016), submitted.
  7. E. Győri, T.R. Mezei, G. Mészáros, Note on Terminal-Pairability in Complete Grid Graphs, Discrete Mathematics (2016), accepted for publication.
  8. E. Győri, T.R. Mezei, G. Mészáros, Terminal-Pairability in Complete Graphs, Journal of Combinatorial Mathematics and Combinatorial Computing (2016), accepted for publication.
  9. G. Mészáros, On Path-Pairability in the Cartesian Product of Graphs, Discussiones Mathematicae Graph Theory 36 (2016), 743–758.
  10. G. Mészáros, On Linkedness of the Cartesian Product of Graphs, Periodica Mathematica Hungarica 72 (2016), 130–138.
  11. T. Kittipassorn, G. Mészáros, Frustrated Triangles, Discrete Mathematics 338 (2015), 2363–2373.
  12. G. Mészáros, Note on the Diameter of Path-Pairable Graphs, Discrete Mathematics 337 (2014), 83–86.

Talks

Conference Talks

Seminar Talks

  • Line Percolation in Projective Planes, Combinatorics Seminar, The University of Memphis, March 2017
  • Terminal-Pairability in Graphs, Combinatorics Seminar, The University of Memphis, December 2016
  • Frustrated Triangles, PhD Seminar, The University of Memphis, February 2014
  • Parameter Bounds in Path-Pairable Graphs, PhD Seminar, The University of Memphis, November 2013
  • Inheritance of Linkedness in the Cartesian Product of Graphs, PhD Seminar, The University of Memphis, September 2013
  • Linkedness, Orderedness and Connectivity in Graphs, PhD Seminar, Central European University, March 2013
  • Byzantine Agreement, PhD Seminar, Central European University, March 2013
  • Configurations in non-Desarguesian planes, PhD Seminar, Central European University, September 2012

Additional Informal Talks

  • Path-Pairability in Graphs (in Hungarian), Meet The Scientist, Városmajori High School, Budapest, November 2015
  • Multi-Party Computation and Byzantine Generals, Cantor Sect, The University of Memphis, April 2014
  • Mathematical Magic Tricks (in Hungarian), Apáczai Csere János High School, March 2013