JCSS
2010
13 years 10 months ago
2010
: Every cluster in a bounded and live free-choice system has a unique blocking marking. It can be reached by firing an occurrence sequence, which avoids any transition of the clust...
COMBINATORICS
2002
13 years 11 months ago
2002
We give a short proof of the Littlewood-Richardson rule using a sign-reversing involution.
DAM
2007
13 years 11 months ago
2007
We give a short proof of a result of Tovey [6] on the inapproximability of a scheduling problem known as precedence constrained class sequencing. In addition, we present an approxi...
COMBINATORICS
2007
13 years 11 months ago
2007
In this note we present a short proof of the following result, which is a slight extension of a nice 2005 theorem by Kano and Yu. Let e be an edge of an rregular graph G. If G has...
CCCG
2008
14 years 29 days ago
2008
We give a very short proof of the following result of Graham from 1980: For any finite coloring of Rd , d 2, and for any > 0, there is a monochromatic (d + 1)-tuple that span...