Algebraic Shifting of Finite Graphs
From MaRDI portal
Abstract: In the present paper, exterior algebraic shifting and symmetric algebraic shifting of bipartite graphs and chordal graphs are studied. First, we will determine the symmetric algebraic shifted graph of complete bipartite graphs. It turns out that, for and , the exterior algebraic shifted graph of the complete bipartite graph of size is different from the symmetric algebraic shifted graph of . Second, we will show that the exterior algebraic shifted graph of any chordal graph is coincident with the symmetric algebraic shifted graph of .
Recommendations
Cites work
- A theorem on refining division orders by the reverse lexicographic order
- Gotzmann theorems for exterior algebras and combinatorics
- Hyperconnectivity of graphs
- Ideals with stable Betti numbers
- INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS
- On a conjecture of milner on k-graphs with non-disjoint edges
- Shifting operations and graded Betti numbers
This page was built for publication: Algebraic Shifting of Finite Graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5426296)