![](https://dblp.dagstuhl.de/img/logo.ua.320x120.png)
![](https://dblp.dagstuhl.de/img/dropdown.dark.16x16.png)
![](https://dblp.dagstuhl.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.dagstuhl.de/img/search.dark.16x16.png)
![search dblp](https://dblp.dagstuhl.de/img/search.dark.16x16.png)
default search action
Journal of Combinatorial Theory, Series A, Volume 43
Volume 43, Number 1, September 1986
- Robert Cori, Serge Dulucq, Gérard Viennot:
Shuffle of parenthesis systems and baxter permutations. 1-22 - Fan R. K. Chung, Ronald L. Graham, Peter Frankl, James B. Shearer:
Some intersection theorems for ordered sets and graphs. 23-37 - David Preiss, Vojtech Rödl:
Note on decomposition of spheres in Hilbert spaces. 38-44 - Kevin T. Phelps:
Every finite group is the automorphism group of some perfect code. 45-51 - Kung-Wei Yang:
Generalized Euler and Chu-Vandermonde identities. 52-57 - Péter L. Erdös, Gyula O. H. Katona:
All maximum 2-part Sperner families. 58-69 - George E. Andrews, Ian P. Goulden, David M. Jackson:
Shanks' convergence acceleration transform, Padé approximants and partitions. 70-84 - László Pyber:
A new generalization of the Erdös-Ko-Rado theorem. 85-90 - Noga Alon, Kenneth A. Berman:
Regular hypergraphs, Gordon's lemma, Steinitz' lemma and invariant theory. 91-97 - Hiroshi Kimura:
Hadamard matrices of order 28 with automorphism groups of order two. 98-102 - Richard P. Stanley:
Symmetries of plane partitions. 103-113 - Mohammad Q. Hailat:
k-rootsystems. 114-129 - William O. J. Moser:
The number of subsets without a fixed circular distance. 130-132 - Tran van Trung:
Non-embeddable quasi-residual designs with k lt v/2. 133-137 - Michael Klemm:
Über den p-rang von inzidenzmatrizen. 138-139 - Anne Delandsheer, Jean DoyenJohannes Siemons, Chiara Tamburini:
Doubly homogeneous 2-(v, k, 1) designs. 140-145 - Christopher F. Woodcock:
On orthogonal latin squares. 146-148
Volume 43, Number 2, November 1986
- Walter T. Federer, John P. Mandeli:
Orthogonal F-rectangles, orthogonal arrays, and codes. 149-164 - Aviezri S. Fraenkel, Yaacov Yesha:
The generalized Sprague-Grundy function and its invariance under certain mappings. 165-177 - James E. Baumgartner:
Partition relations for countable topological spaces. 178-195 - Ron Aharoni, Nathan Linial:
Minimal non-two-colorable hypergraphs and minimal unsatisfiable formulas. 196-204 - Jacques Justin, Giuseppe Pirillo:
On a natural extension of Jacob's ranks. 205-218 - Vladimir D. Tonchev
:
A characterization of designs related to dodecads in the witt system S(5, 8, 24). 219-227 - Peter Frankl, Richard M. Wilson:
The Erdös-Ko-Rado theorem for vector spaces. 228-236 - Donald L. Kreher
, Stanislaw P. Radziszowski:
The existence of simple 6-(14, 7, 4) designs. 237-243 - Edward A. Bender, E. Rodney Canfield:
The asymptotic number of rooted maps on a surface. 244-257 - Vera Pless:
Q-codes. 258-276 - Aaron Meyerowitz, Sharad S. Sane, Mohan S. Shrikhande:
New results for quasi-symmetric designs - An application of MACSYMA. 277-290 - Luc Teirlinck:
Combinatorial properties of planar spaces and embeddability. 291-302 - Charles Brenner:
Asymptotic analogs of the Rogers-Ramanujan identities. 303-319 - Allan Berele:
A schensted-type correspondence for the symplectic group. 320-328 - Péter Komjáth:
An infinite version of Ryser's inequality. 329-330 - Vera Pless:
Cyclic projective planes and binary, extended cyclic self-dual codes. 331-333 - Dieter Jungnickel, Scott A. Vanstone:
On resolvable designs S3(3; 4, v). 334-337 - Vitaly Bergelson:
A density statement generalizing Schur's theorem. 338-343 - Herbert Edelsbrunner, Gerd Stöckl:
The number of extreme pairs of finite point-sets in Euclidean spaces. 344-349 - K. T. Arasu:
(81, 16, 3) Abelian difference sets do not exist. 350-353
![](https://dblp.dagstuhl.de/img/cog.dark.24x24.png)
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.