Sciweavers

Share
JCSS
2010
68views more  JCSS 2010»
9 years 10 months ago
Simplified proof of the blocking theorem for free-choice Petri nets
: 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...
Joachim Wehler
COMBINATORICS
2002
89views more  COMBINATORICS 2002»
9 years 11 months ago
A Concise Proof of the Littlewood-Richardson Rule
We give a short proof of the Littlewood-Richardson rule using a sign-reversing involution.
John R. Stembridge
DAM
2007
91views more  DAM 2007»
9 years 11 months ago
A note on the precedence-constrained class sequencing problem
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...
José R. Correa, Samuel Fiorini, Nicol&aacut...
COMBINATORICS
2007
73views more  COMBINATORICS 2007»
9 years 11 months ago
A Short Proof of a Theorem of Kano and Yu on Factors in Regular Graphs
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...
Lutz Volkmann
CCCG
2008
10 years 29 days ago
Monochromatic simplices of any volume
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...
Adrian Dumitrescu, Minghui Jiang
books