License: Creative Commons Attribution 3.0 Unported license (CC BY 3.0)
When quoting this document, please refer to the following
DOI: 10.4230/DagRep.9.9.135
URN: urn:nbn:de:0030-drops-118460
URL: http://dagstuhl.sunsite.rwth-aachen.de/volltexte/2020/11846/
Go back to Dagstuhl Reports

Ellis-Monaghan, Jo ; Goodall, Andrew ; Moffatt, Iain ; Morgan, Kerri
Weitere Beteiligte (Hrsg. etc.): Jo Ellis-Monaghan and Andrew Goodall and Iain Moffatt and Kerri Morgan

Comparative Theory for Graph Polynomials (Dagstuhl Seminar 19401)

pdf-format:
dagrep_v009_i009_p135_19401.pdf (4 MB)

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.

BibTeX - Entry

@Article{ellismonaghan_et_al:DR:2020:11846,
  author =	{Jo Ellis-Monaghan and Andrew Goodall and Iain Moffatt and Kerri Morgan},
  title =	{{Comparative Theory for Graph Polynomials (Dagstuhl Seminar 19401)}},
  pages =	{135--155},
  journal =	{Dagstuhl Reports},
  ISSN =	{2192-5283},
  year =	{2020},
  volume =	{9},
  number =	{9},
  editor =	{Jo Ellis-Monaghan and Andrew Goodall and Iain Moffatt and Kerri Morgan},
  publisher =	{Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/opus/volltexte/2020/11846},
  URN =		{urn:nbn:de:0030-drops-118460},
  doi =		{10.4230/DagRep.9.9.135},
  annote =	{Keywords: graph polynomials, graph and matroid invariants, Tutte polynomial, topological and algebraic graph theory}
}

Keywords: graph polynomials, graph and matroid invariants, Tutte polynomial, topological and algebraic graph theory
Collection: Dagstuhl Reports, Volume 9, Issue 9
Issue Date: 2020
Date of publication: 19.02.2020

DROPS-Home | Fulltext Search | Imprint | Privacy Published by LZI