Skip to content
naulon
Not checkedNot checked for notices yet.

The Regularity of Edge Rings and Matching Numbers

Jürgen Herzog, Takayuki Hibi

Mathematics · 2020

doi:10.3390/math8010039 (opens in a new tab)

We email you when a new notice or a question about this paper appears.

Abstract

Let <inline-formula> <math display="inline"> <semantics> <mrow> <mi>K</mi> <mo stretchy="false">[</mo> <mi>G</mi> <mo stretchy="false">]</mo> </mrow> </semantics> </math> </inline-formula> denote the edge ring of a finite connected simple graph <i>G</i> on <inline-formula> <math display="inline"> <semantics> <mrow> <mo stretchy="false">[</mo> <mi>d</mi> <mo stretchy="false">]</mo> </mrow> </semantics> </math> </inline-formula> and <inline-formula> <math display="inline"> <semantics> <mrow> <mi>mat</mi> <mo stretchy="false">(</mo> <mi>G</mi> <mo stretchy="false">)</mo> </mrow> </semantics> </math> </inline-formula> the matching number of <i>G</i>. It is shown that <inline-formula> <math display="inline"> <semantics> <mrow> <mi>reg</mi> <mo stretchy="false">(</mo> <mi>K</mi> <mo stretchy="false">[</mo> <mi>G</mi> <mo stretchy="false">]</mo> <mo stretchy="false">)</mo> <mo>&#8804;</mo> <mi>mat</mi> <mo stretchy="false">(</mo> <mi>G</mi> <mo stretchy="false">)</mo> </mrow> </semantics> </math> </inline-formula> if <i>G</i> is non-bipartite and <inline-formula> <math display="inline"> <semantics> <mrow> <mi>K</mi> <mo stretchy="false">[</mo> <mi>G</mi> <mo stretchy="false">]</mo> </mrow> </semantics> </math> </inline-formula> is normal, and that <inline-formula> <math display="inline"> <semantics> <mrow> <mi>reg</mi> <mo stretchy="false">(</mo> <mi>K</mi> <mo stretchy="false">[</mo> <mi>G</mi> <mo stretchy="false">]</mo> <mo stretchy="false">)</mo> <mo>&#8804;</mo> <mi>mat</mi> <mo stretchy="false">(</mo> <mi>G</mi> <mo stretchy="false">)</mo> <mo>&#8722;</mo> <mn>1</mn> </mrow> </semantics> </math> </inline-formula> if <i>G</i> is bipartite.

Abstract licence: CC BY

Reads

Read by people on this page

None yet.

Checked or read by AI through naulon

None yet.

A person counts once a day per paper. We keep no cookie and no address: a reader is a hash that changes every day. Any month under five reads shows no number.

Are you an author?

Is this your paper?

Claim it to add your note and be paid when agents cite it. Free.