From matrix pivots to graphs in surfaces: exploring combinatorics through partial duals (Q6064591)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: From matrix pivots to graphs in surfaces: exploring combinatorics through partial duals |
scientific article; zbMATH DE number 7763417
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | From matrix pivots to graphs in surfaces: exploring combinatorics through partial duals |
scientific article; zbMATH DE number 7763417 |
Statements
From matrix pivots to graphs in surfaces: exploring combinatorics through partial duals (English)
0 references
10 November 2023
0 references
Summary: To what extent is a graph determined by the trees in it? What changes if we ask this question not for graphs in the abstract, but graphs that are embedded on surfaces? By considering these questions we will see how a collection of seemingly disjoint topics in mathematics are brought together through the idea of a partial dual. For the entire collection see [Zbl 1519.00033].
0 references
delta-matroid
0 references
dual
0 references
embedded graph
0 references
matroid
0 references
partial dual
0 references
pivot
0 references
quasi-tree
0 references
ribbon graph
0 references
tree
0 references
