131 search results - page 11 / 27 » combinatorics 2004 |
COMBINATORICS
2004
13 years 9 months ago
2004
Erdos posed the problem of how many random subsets need to be chosen from a set of n elements, each element appearing in each subset with probability p = 1/2, in order that at lea...
COMBINATORICS
2004
13 years 9 months ago
2004
We develop an analog of the exponential families of Wilf in which the label sets are finite dimensional vector spaces over a finite field rather than finite sets of positive integ...
COMBINATORICS
2004
13 years 9 months ago
2004
New conjectures are proposed on the numbers of FPL configurations pertaining to certain types of link patterns. Making use of the Razumov and Stroganov Ansatz, these conjectures a...
COMBINATORICS
2004
13 years 9 months ago
2004
We propose two alternative measures of the local irregularity of a graph in terms of its vertex degrees and relate these measures to the order and the global irregularity of the g...
COMBINATORICS
2004
13 years 9 months ago
2004
We construct smallest known trivalent graphs for girths 16 and 18. One construction uses voltage graphs, and the other coset enumeration techniques for group presentations. AMS Su...