Sciweavers

DM
1999
55views more  DM 1999»
13 years 11 months ago
New t-designs and large sets of t-designs
Anton Betten, Reinhard Laue, Alfred Wassermann
DM
1999
66views more  DM 1999»
13 years 11 months ago
Graphical t-designs via polynomial Kramer-Mesner matrices
Anton Betten, Mikhail H. Klin, Reinhard Laue, Alfr...
DM
1999
45views more  DM 1999»
13 years 11 months ago
Polarities and 2k-cycle-free graphs
Felix Lazebnik, Vasiliy A. Ustimenko, Andrew J. Wo...
DM
1999
64views more  DM 1999»
13 years 11 months ago
On perfectness of sums of graphs
Dominique de Werra, Alain Hertz
DM
1999
70views more  DM 1999»
13 years 11 months ago
Tightness problems in the plane
Bernardo M. Ábrego, Jorge L. Arocha, Silvia...
DM
1999
48views more  DM 1999»
13 years 11 months ago
Spanning trees of countable graphs omitting sets of dominated ends
François Laviolette, Norbert Polat
DM
1999
69views more  DM 1999»
13 years 11 months ago
Maximal sets of mutually orthogonal Latin squares
Maximal sets of s mutually orthogonal Latin squares of order v are constructed for in
David A. Drake, G. H. John van Rees, W. D. Wallis
DM
1999
133views more  DM 1999»
13 years 11 months ago
The answer to Woodall's musquash problem
We prove that there are no n-agonal musquashes for n even with n = 6. This resolves a problem raised in Woodall's 1971 paper `Thrackles and Deadlock'. c 1999 Elsevier Sc...
Grant Cairns, Deborah M. King
DM
1999
109views more  DM 1999»
13 years 11 months ago
Complexity of sequences and dynamical systems
Sébastien Ferenczi
DM
1999
61views more  DM 1999»
13 years 11 months ago
Some codes related to BCH-codes of low dimension
We construct a large number of record-breaking binary, ternary and quaternary codes. Our methods involve the study of BCH-codes over larger fields, concatenation, construction X a...
Yves Edel, Jürgen Bierbrauer