Download this article
Download this article For screen
For printing
Recent Issues
Volume 4, Issue 1
Volume 3, Issue 3
Volume 3, Issue 2
Volume 3, Issue 1
Volume 2, Issue 2
Volume 2, Issue 1
Volume 1, Issue 1
The Journal
About the journal
Ethics and policies
Peer-review process
 
Submission guidelines
Submission form
Editorial board
 
 
ISSN 2832-904X (online)
ISSN 2832-9058 (print)
 
Author index
To appear
 
Other MSP journals
How I got to like graph polynomials

Johann A. Makowsky
Vol. 3 (2024), No. 2, 465–477
DOI: 10.2140/mt.2024.3.465
Abstract

I trace the roots of my collaboration with Boris Zil’ber, which combines categoricity theory, finite model theory, algorithmics, and combinatorics.

For Boris Zil'ber on his 75th birthday
Keywords
categoricity, parametrized complexity, graph algorithms, graph polynomials
Mathematical Subject Classification
Primary: 05C13, 05C35, 05C31, 68Q99
Milestones
Received: 7 February 2023
Revised: 5 August 2023
Accepted: 5 September 2023
Published: 19 July 2024
Authors
Johann A. Makowsky
Faculty of Computer Science
Technion–Israel Institute of Technology Haifa
Israel
© 2024 MSP (Mathematical Sciences Publishers).