Sciweavers

492 search results - page 60 / 99
» combinatorics 2006
Sort
View
COMBINATORICS
1999
113views more  COMBINATORICS 1999»
14 years 9 months ago
Bicoloring Steiner Triple Systems
A Steiner triple system has a bicoloring with m color classes if the points are partitioned into m subsets and the three points in every block are contained in exactly two of the ...
Charles J. Colbourn, Jeffrey H. Dinitz, Alexander ...
COMBINATORICS
1999
80views more  COMBINATORICS 1999»
14 years 9 months ago
On the Theory of Pfaffian Orientations. I. Perfect Matchings and Permanents
Kasteleyn stated that the generating function of the perfect matchings of a graph of genus g may be written as a linear combination of 4g Pfaffians. Here we prove this statement. ...
Anna Galluccio, Martin Loebl
COMBINATORICS
1999
62views more  COMBINATORICS 1999»
14 years 9 months ago
An infinite Family of Non-embeddable Hadamard Designs
The parameters 2 - (2 + 2, + 1, ) are those of a residual Hadamard 2 (4 + 3, 2 + 1, ) design. All 2 - (2 + 2, + 1, ) designs with 4 are embeddable. The existence of non-embedd...
Kirsten Mackenzie-Fleming
COMBINATORICS
2004
94views more  COMBINATORICS 2004»
14 years 9 months ago
Even Astral Configurations
A configuration (pq, nk) is a collection of p points and n straight lines in the Euclidean plane so that every point has q straight lines passing through it and every line has k p...
Leah Wrenn Berman
COMBINATORICS
2004
108views more  COMBINATORICS 2004»
14 years 9 months ago
On the Chromatic Number of Intersection Graphs of Convex Sets in the Plane
Let G be the intersection graph of a finite family of convex sets obtained by translations of a fixed convex set in the plane. We show that every such graph with clique number k i...
Seog-Jin Kim, Alexandr V. Kostochka, Kittikorn Nak...