Sciweavers

1215 search results - page 108 / 243
» Combinatorics
Sort
View
116
Voted
COMBINATORICS
2006
124views more  COMBINATORICS 2006»
15 years 3 months ago
Cubic Partial Cubes from Simplicial Arrangements
We show how to construct a cubic partial cube from any simplicial arrangement of lines or pseudolines in the projective plane. As a consequence, we find nine new infinite families...
David Eppstein
COMBINATORICS
2006
109views more  COMBINATORICS 2006»
15 years 3 months ago
The Strongly Regular (45, 12, 3, 3) Graphs
Using two backtrack algorithms based on different techniques, designed and implemented independently, we were able to determine up to isomorphism all strongly regular graphs with ...
Kris Coolsaet, Jan Degraer, Edward Spence
98
Voted
COMBINATORICS
2006
113views more  COMBINATORICS 2006»
15 years 3 months ago
Monochromatic and Zero-Sum Sets of Nondecreasing Modified Diameter
Let m be a positive integer whose smallest prime divisor is denoted by p, and let Zm denote the cyclic group of residues modulo m. For a set B = {x1, x2, . . . , xm} of m integers...
David J. Grynkiewicz, Rasheed Sabar
COMBINATORICS
2006
135views more  COMBINATORICS 2006»
15 years 3 months ago
Drawing a Graph in a Hypercube
A d-dimensional hypercube drawing of a graph represents the vertices by distinct points in {0, 1}d, such that the line-segments representing the edges do not cross. We study lower...
David R. Wood
116
Voted
COMBINATORICS
2006
142views more  COMBINATORICS 2006»
15 years 3 months ago
The Zeta Function of a Hypergraph
We generalize the Ihara-Selberg zeta function to hypergraphs in a natural way. Hashimoto's factorization results for biregular bipartite graphs apply, leading to exact factor...
Christopher K. Storm