Sciweavers

EJC
2011
13 years 6 months ago
Bounds on generalized Frobenius numbers
Let N ≥ 2 and let 1 < a1 < · · · < aN be relatively prime integers. The Frobenius number of this N-tuple is defined to be the largest positive integer that has no re...
Lenny Fukshansky, Achill Schürmann
JCT
1998
122views more  JCT 1998»
13 years 11 months ago
Counting 1-Factors in Regular Bipartite Graphs
We show that any k-regular bipartite graph with 2n vertices has at least ((k−1)k−1 kk−2 )n perfect matchings (1-factors). Equivalently, this is a lower bound on the permanent...
Alexander Schrijver
FAW
2007
Springer
177views Algorithms» more  FAW 2007»
14 years 5 months ago
The Parameterized Complexity of the Induced Matching Problem in Planar Graphs
Abstract. Given a graph G and a nonnegative integer k, the NP-complete Induced Matching problem asks for an edge subset M such that M is a matching and no two edges of M are joined...
Hannes Moser, Somnath Sikdar