Sciweavers

COMBINATORICS
1998
51views more  COMBINATORICS 1998»
13 years 3 months ago
Minimal Cycle Bases of Outerplanar Graphs
Josef Leydold, Peter F. Stadler
COMBINATORICS
1998
76views more  COMBINATORICS 1998»
13 years 3 months ago
An Exploration of the Permanent-Determinant Method
The permanent-determinant method and its generalization, the HafnianPfaffian method, are methods to enumerate perfect matchings of plane graphs that were discovered by P. W. Kaste...
Greg Kuperberg
COMBINATORICS
1998
66views more  COMBINATORICS 1998»
13 years 3 months ago
Some New Ramsey Colorings
New lower bounds for 15 classical Ramsey numbers are established. Several of the colorings are found using a new variation of local search heuristics. Several others are found usi...
Geoffrey Exoo
COMBINATORICS
1998
63views more  COMBINATORICS 1998»
13 years 3 months ago
On Kissing Numbers in Dimensions 32 to 128
An elementary construction using binary codes gives new record kissing numbers in dimensions from 32 to 128.
Yves Edel, Eric M. Rains, Neil J. A. Sloane
COMBINATORICS
1998
102views more  COMBINATORICS 1998»
13 years 3 months ago
Inclusion-Exclusion and Network Reliability
Based on a recent improvement of the inclusion-exclusion principle, we present a new approach to network reliability problems. In particular, we give a new proof of a result of Sh...
Klaus Dohmen
COMBINATORICS
1998
130views more  COMBINATORICS 1998»
13 years 3 months ago
Codes and Projective Multisets
The paper gives a matrix-free presentation of the correspondence between full-length linear codes and projective multisets. It generalizes the BrouwerVan Eupen construction that t...
Stefan M. Dodunekov, Juriaan Simonis
COMBINATORICS
1998
60views more  COMBINATORICS 1998»
13 years 3 months ago
Finite Vector Spaces and Certain Lattices
The Galois number Gn(q) is defined to be the number of subspaces of the n-dimensional vector space over the finite field GF(q). When q is prime, we prove that Gn(q) is equal to...
Thomas W. Cusick
COMBINATORICS
1998
91views more  COMBINATORICS 1998»
13 years 3 months ago
New Bounds for Union-free Families of Sets
: Following Frankl and F¨uredi [1] we say a family, F, of subsets of an n-set is weakly union-free if F does not contain four distinct sets A, B, C, D with A ∪ B = C ∪ D. If i...
Don Coppersmith, James B. Shearer
COMBINATORICS
1998
99views more  COMBINATORICS 1998»
13 years 3 months ago
Constructions for Cubic Graphs with Large Girth
The aim of this paper is to give a coherent account of the problem of constructing cubic graphs with large girth. There is a well-defined integer µ0(g), the smallest number of v...
Norman Biggs