Sciweavers

1215 search results - page 99 / 243
» Combinatorics
Sort
View
120
Voted
COMBINATORICS
2002
83views more  COMBINATORICS 2002»
15 years 3 months ago
Identifying Codes with Small Radius in Some Infinite Regular Graphs
Let G = (V, E) be a connected undirected graph and S a subset of vertices. If for all vertices v V , the sets Br(v) S are all nonempty and different, where Br(v) denotes the set...
Irène Charon, Olivier Hudry, Antoine Lobste...
97
Voted
COMBINATORICS
2002
62views more  COMBINATORICS 2002»
15 years 3 months ago
New Lower Bounds for Heilbronn Numbers
The n-th Heilbronn number, Hn, is the largest value such that n points can be placed in the unit square in such a way that all possible triangles defined by any three of the point...
Francesc Comellas, J. Luis A. Yebra
131
Voted
COMBINATORICS
2002
113views more  COMBINATORICS 2002»
15 years 3 months ago
Longest Increasing Subsequences in Pattern-Restricted Permutations
Inspired by the results of Baik, Deift and Johansson on the limiting distribution of the lengths of the longest increasing subsequences in random permutations, we find those limit...
Emeric Deutsch, A. J. Hildebrand, Herbert S. Wilf
137
Voted
COMBINATORICS
2002
76views more  COMBINATORICS 2002»
15 years 3 months ago
On the Number of Distributive Lattices
We investigate the numbers dk of all (isomorphism classes of) distributive lattices with k elements, or, equivalently, of (unlabeled) posets with k antichains. Closely related and...
Marcel Erné, Jobst Heitzig, Jürgen Rei...
87
Voted
COMBINATORICS
2002
70views more  COMBINATORICS 2002»
15 years 3 months ago
Set-Systems with Restricted Multiple Intersections
We give a generalization for the Deza-Frankl-Singhi Theorem in case of multiple intersections. More exactly, we prove, that if H is a set-system, which satisfies that for some k, ...
Vince Grolmusz