System Upgrade on Tue, May 28th, 2024 at 2am (EDT)

Existing users will be able to log into the site and access content. However, E-commerce and registration of new users may not be available for up to 12 hours.
For online purchase, please visit us again. Contact us at customercare@wspc.com for any enquiries.

Advanced Search

SEARCH GUIDE

Narrow Results

Results: 1 - 1of1

Follow results:

per page:

Sort: Relevance

Context for search term 1Search term 1*

All Dates

LastSelect static range

Custom Range

Select starting monthSelect starting year

Select ending monthSelect ending year

Search name	Searched On	Run search
Keyword: Gap-free Graphs (1)	31 Mar 2025	Run
Keyword: Hyperarithmetic (3)	31 Mar 2025	Run
Keyword: Commodity Trade (4)	31 Mar 2025	Run
Keyword: Price Mechanism (2)	31 Mar 2025	Run
Keyword: The Probability (2)	31 Mar 2025	Run

articleNo Access
Edge Ideals with Regularity No More than Three
- Aming Liu and
- Tongsuo Wu
Algebra Colloquium05 Nov 2020
Preview Abstract
We prove that if G is a gap-free and chair-free simple graph, then the regularity of the edge ideal of G is no more than 3. If G is a gap-free and P₄-free graph, then it is a chair-free graph; furthermore, the complement of G is chordal, and thus the regularity of G is 2.

1