COMBINATORICS
2006
13 years 4 months ago
2006
We associate one or two posets (which we call "semistandard posets") to any given irreducible representation of a rank two semisimple Lie algebra over C. Elsewhere we ha...
COMBINATORICS
2006
13 years 4 months ago
2006
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...
COMBINATORICS
2006
13 years 4 months ago
2006
A set M of edges of a graph G is a matching if no two edges in M are incident to the same vertex. The matching number of G is the maximum cardinality of a matching of G. A set S o...
COMBINATORICS
2006
13 years 4 months ago
2006
We prove several results regarding edge-colored complete graphs and rainbow cycles, cycles with no color appearing on more than one edge. We settle a question posed by Ball, Pultr...
COMBINATORICS
2006
13 years 4 months ago
2006
A biclique is a complete bipartite subgraph of a graph. This paper investigates the fractional biclique cover number, bc(G), and the fractional biclique partition number, bp(G), o...
COMBINATORICS
2006
13 years 4 months ago
2006
COMBINATORICS
2006
13 years 4 months ago
2006
We consider the problem of permutation reconstruction, which is a variant of graph reconstruction. Given a permutation p of length n, we delete k of its entries in each possible w...
COMBINATORICS
2006
13 years 4 months ago
2006
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...
COMBINATORICS
2006
13 years 4 months ago
2006
Beauquier and Nivat introduced and gave a characterization of the class of pseudo-square polyominoes that tile the plane by translation: a polyomino tiles the plane by translation...
COMBINATORICS
2006
13 years 4 months ago
2006
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 ...