| |
|
Description: |
The Eulerian ideal of a graph establishes yet another bridge between algebra and combinatorics. It encodes much information about the graph: its generators can be related to the Eulerian subgraphs with an even number of edges and, for a fixed monomial order, the associated standard basis is related to the set of even subsets of vertices and to the set of minimum cardinality $T$-joins. In this talk, we will focus on an algebraic invariant of the ideal, called the Castelnuovo-Mumford regularity, and describe the corresponding graph invariant. While for bipartite graphs this invariant is known and well-studied (it is the maximum cardinality of a minimum T-join) for non-bipartite graphs this connection reveals a new invariant.
|
|
Date: |
|
| Start Time: |
14:30 |
|
Speaker: |
Jorge Sentieiro Neves (CMUC, Univ. Coimbra)
|
|
Institution: |
CMUC, Univ. Coimbra
|
|
Place: |
Zoom: https://videoconf-colibri.zoom.us/j/87906003456?pwd=OEF2QmJKWW91TTNsUFJiOWQ2WjRrdz09
|
| Research Groups: |
-Algebra and Combinatorics
|
|
See more:
|
<Main>
|
|
