Our proof (with Robertson and Thomas) of the strong perfect graph conjecture ran to 179 pages of dense matter; and the most impenetrable part was the final 55 pages, on what we called “wheel systems”. In this paper we give a replacement for those 55 pages, much easier and shorter, using “even pairs”. This is based on an approach of Maffray and Trotignon.

A c-ary Perfect Factor is a set of uniformly long cycles whose elements are drawn from a set of size c, in which every possible v-tuple of elements occurs exactly once. In the binary case, i.e. where c = 2, these perfect factors have previously been studied by Etzion, [2], who showed that the obvious necessary conditions for their existence are in fact sufficient. This result has recently been ...

Fault-tolerance and lookup consistency are considered crucial properties for building applications on top of structured overlay networks. Many of these networks use the ring topology for the organization or their peers. The network must handle multiple joins, leaves and failures of peers while keeping the connection between every pair of successor-predecessor correct. This property makes the ma...

The object of this paper is to study the relationship between certain projective modules and their endomorphism rings. Specifically, the basic problem is to describe the projective modules whose endomorphism rings are (von Neumann) regular, local semiperfect, or left perfect. Call a projective module regular if every cyclic submodule is a direct summand. Thus a ring is a regular module if it is...

We study Gorenstein dimension and grade of a module M over a filtered ring whose assosiated graded ring is a commutative Noetherian ring. An equality or an inequality between these invariants of a filtered module and its associated graded module is the most valuable property for an investigation of filtered rings. We prove an inequality G-dimM ≤ G-dimgrM and an equality gradeM = grade grM , whe...

in this paper, we study some ring theoretic properties of the amalgamated duplication ring $rbowtie i$ of a commutative noetherian ring $r$ along an ideal $i$ of $r$ which was introduced by d'anna and fontana. indeed, it is determined that when $rbowtie i$ satisfies serre's conditions $(r_n)$ and $(s_n)$, and when is a normal ring, a generalized cohen-macaulay ring and finally a filter ring.

The complement of a graph G is denoted by G. χ(G) denotes the chromatic number and ω(G) the clique number of G. The cycles of odd length at least five are called odd holes and the complements of odd holes are called odd anti-holes. A graph G is called perfect if, for each induced subgraph G of G, χ(G) = ω(G). Classical examples of perfect graphs consist of bipartite graphs, chordal graphs and c...

The Strong Perfect Graph Conjecture (SPGC) was certainly one of the most challenging conjectures in graph theory. During more than four decades, numerous attempts were made to solve it, by combinatorial methods, by linear algebraic methods, or by polyhedral methods. The rst of these three approaches yielded the rst (and to date only) proof of the SPGC; the other two remain promising to consider...

The pre-coloring extension problem consists, given a graph G and a subset of nodes to which some colors are already assigned, in finding a coloring of G with the minimum number of colors which respects the pre-coloring assignment. This can be reduced to the usual coloring problem on a certain contracted graph. We prove that pre-coloring extension is polynomial for complements of Meyniel graphs....