Independent sets from an algebraic perspective
In this paper, we study the basic problem of counting independent sets in a graph and, in particular, the problem of counting antichains in a finite poset, from an algebraic perspective. We show that neither independence polynomials of bipartite CohenMacaulay graphs nor Hilbert series of initial ide...
Guardado en:
Autores principales: | Dickenstein, A., Tobis, E.A. |
---|---|
Formato: | JOUR |
Materias: | |
Acceso en línea: | http://hdl.handle.net/20.500.12110/paper_02181967_v22_n2_p_Dickenstein |
Aporte de: |
Ejemplares similares
-
Independent sets from an algebraic perspective
por: Dickenstein, Alicia Marcela, et al.
Publicado: (2012) -
Métodos algebraicos para problemas discretos
por: Tobis, Enrique Augusto
Publicado: (2009) -
Métodos algebraicos para problemas discretos
por: Tobis, Enrique Augusto
Publicado: (2009) -
Métodos algebraicos para problemas discretos
por: Tobis, Enrique Augusto
Publicado: (2009) -
Algorithms for clique-independent sets on subclasses of circular-arc graphs
por: Durán, Guillermo A., et al.
Publicado: (2006)