DagRep.9.9.135.pdf
- Filesize: 3.57 MB
- 21 pages
Document
Comparative Theory for Graph Polynomials (Dagstuhl Seminar 19401)
Authors and all authors of the abstracts in this report
-
Part of:
Issue:
Dagstuhl Reports, Volume 9, Issue 9
Volume: Dagstuhl Reports, Volume 9
Journal: Dagstuhl Reports (DagRep) - License:
Creative Commons Attribution 3.0 Unported license
- Publication Date: 2020-02-19
Cite As Get BibTex
Jo Ellis-Monaghan, Andrew Goodall, Iain Moffatt, and Kerri Morgan. Comparative Theory for Graph Polynomials (Dagstuhl Seminar 19401). In Dagstuhl Reports, Volume 9, Issue 9, pp. 135-155, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2020)
https://doi.org/10.4230/DagRep.9.9.135
Abstract
This report documents the programme and outcomes of Dagstuhl Seminar 19401 ``Comparative Theory for Graph Polynomials''. The study of graph polynomials has become increasingly active, with new applications and new graph polynomials being discovered each year. The genera of graph polynomials are diverse, and their interconnections are rich. Experts in the field are finding that proof techniques and results established in one area can be successfully extended to others. From this a general theory is emerging that encapsulates the deeper interconnections between families of graph polynomials and the various techniques, computational approaches, and methodologies applied to them. The overarching aim of this Seminar was to exploit commonalities among polynomial invariants of graphs, matroids, and related combinatorial structures. Model-theoretic, computational and other methods were used in order to initiate a comparative theory that collects the current state of knowledge into a more cohesive and powerful framework.
Subject Classification
Keywords
- graph polynomials
- graph and matroid invariants
- Tutte polynomial
- topological and algebraic graph theory
Metrics
- Access Statistics
-
Total Accesses (updated on a weekly basis)
0PDF Downloads