Sciweavers

131 search results - page 14 / 27
» combinatorics 2004
Sort
View
COMBINATORICS
2004
75views more  COMBINATORICS 2004»
13 years 9 months ago
Nonexistence Results for Hadamard-like Matrices
The class of square (0, 1, -1)-matrices whose rows are nonzero and mutually orthogonal is studied. This class generalizes the classes of Hadamard and Weighing matrices. We prove t...
Justin D. Christian, Bryan L. Shader
COMBINATORICS
2004
82views more  COMBINATORICS 2004»
13 years 9 months ago
Decomposing Infinite 2-Connected Graphs into 3-Connected Components
In the 1960's, Tutte presented a decomposition of a 2-connected finite graph into 3-connected graphs, cycles and bonds. This decomposition has been used to reduce problems on...
R. Bruce Richter
COMBINATORICS
2004
108views more  COMBINATORICS 2004»
13 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...
COMBINATORICS
2004
93views more  COMBINATORICS 2004»
13 years 9 months ago
On the Combinatorial Structure of Arrangements of Oriented Pseudocircles
We introduce intersection schemes (a generalization of uniform oriented matroids of rank 3) to describe the combinatorial properties of arrangements of pseudocircles in the plane ...
Johann Linhart, Ronald Ortner
COMBINATORICS
2004
121views more  COMBINATORICS 2004»
13 years 9 months ago
Class-Uniformly Resolvable Group Divisible Structures I: Resolvable Group Divisible Designs
We consider Class-Uniformly Resolvable Group Divisible Designs (CURGDD), which are resolvable group divisible designs in which each of the resolution classes has the same number o...
Peter Danziger, Brett Stevens