Bounds For Invariants of Edge-Rings
- 1 April 2005
- journal article
- Published by Taylor & Francis in Communications in Algebra
- Vol. 33 (5) , 1603-1616
Abstract
Let G be a simple graph with |V(G)| = n and no isolated vertices. Let α be its stability number. We study invariants of the edge-ring of G that can be interpreted as invariants of G. If G has a cover by maximum stable sets we are able to prove the inequality . As a byproduct we prove that if G is vertex-critical, then α ≤ (n − |A|)/2, where A is the intersection of all the minimum vertex covers of G. We estimate the smallest number of vertices in any maximal stable set of G to obtain a bound for the depth of the edge-ring of G. #Communicated by R. Villarreal.Keywords
This publication has 11 references indexed in Scilit:
- The Stable Set of Associated Primes of the Ideal of a GraphRocky Mountain Journal of Mathematics, 2002
- On the equations of the edge cone of a graph¶and some applicationsmanuscripta mathematica, 1998
- On the Ideal Theory of GraphsJournal of Algebra, 1994
- Cohen-macaulay graphsmanuscripta mathematica, 1990
- On the Cohen-Macaulay property in commutative algebra and simplicial topologyPacific Journal of Mathematics, 1990
- Topics in rees algebras of special ideals1990
- The maximum number of cliques in dense graphsDiscrete Mathematics, 1985
- Some Common Properties for Regularizable Graphs, Edge-Critical Graphs and B-Graphs1982
- A Problem in Graph TheoryThe American Mathematical Monthly, 1964
- Ein Satz ber Untermengen einer endlichen MengeMathematische Zeitschrift, 1928