1) La descarga del recurso depende de la página de origen
2) Para poder descargar el recurso, es necesario ser usuario registrado en Universia


Opción 1: Descargar recurso

Detalles del recurso

Descripción

We consider a family of simple graphs known as PS ear-decomposable graphs. These graphs are one-dimensional specializations of the more general class of PS ear-decomposable simplicial complexes, which were by Chari as a means of understanding matroid simplicial complexes. We outline a shifting algorithm for PS ear-decomposable graphs that allows us to explicitly show that the [math] -vector of a PS ear-decomposable graph is a pure [math] -sequence.

Pertenece a

Project Euclid (Hosted at Cornell University Library)  

Autor(es)

Imani, Nima -  Johnson, Lee -  Keeling -  Garcia, Mckenzie -  Klee, Steven -  Pinckney, Casey - 

Id.: 70773985

Idioma: inglés  - 

Versión: 1.0

Estado: Final

Tipo:  application/pdf - 

Palabras clavematroid - 

Tipo de recurso: Text  - 

Tipo de Interactividad: Expositivo

Nivel de Interactividad: muy bajo

Audiencia: Estudiante  -  Profesor  -  Autor  - 

Estructura: Atomic

Coste: no

Copyright: sí

: Copyright 2014 Mathematical Sciences Publishers

Formatos:  application/pdf - 

Requerimientos técnicos:  Browser: Any - 

Relación: [References] 1944-4176
[References] 1944-4184

Fecha de contribución: 21-dic-2017

Contacto:

Localización:
* Involve 7, no. 6 (2014), 743-750
* doi:10.2140/involve.2014.7.743

Otros recursos de la mismacolección

  1. A simple proof characterizing interval orders with interval lengths between 1 and $k$ A poset [math] has an interval representation if each [math] can be assigned a real interval [math] ...
  2. On generalized MacDonald codes We show that the generalized [math] -ary MacDonald codes [math] with parameters [math] are two-weigh...
  3. Rings isomorphic to their nontrivial subrings Let [math] be a nontrivial group, and assume that [math] for every nontrivial subgroup  [math] of [m...
  4. Enumeration of stacks of spheres As a three-dimensional generalization of fountains of coins, we analyze stacks of spheres and enumer...
  5. Time stopping for Tsirelson's norm Tsirelson’s norm [math] on [math] is defined as the limit of an increasing sequence of norms [math] ...

Aviso de cookies: Usamos cookies propias y de terceros para mejorar nuestros servicios, para análisis estadístico y para mostrarle publicidad. Si continua navegando consideramos que acepta su uso en los términos establecidos en la Política de cookies.