Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJournal of Combinatorial Theory, Series A, Volume 25
Volume 25, Number 1, July 1978
- A. C. Mukhopadhyay:
Lower Bounds on mt(r, s). 1-13 - Noboru Hamada:
On a Geometrical Method of Construction of Maximal t-Linearly Independent Sets. 14-28 - John E. Olson, Joel H. Spencer:
Balancing Families of Sets. 29-37 - Charles M. Stein:
Asymptotic Evaluation of the Number of Latin Rectangles. 38-49 - I. Rabinovitch:
The Dimension of Semiorders. 50-61 - Robert E. Kibler:
A Summary of Noncyclic Difference Sets, k<20. 62-67 - I. Rabinovitch:
An Upper Bound on the "Dimension of Interval Orders". 68-71 - H. L. Abbott, A. Liu:
A Covering Theorem for Quasi-groups. 72-75 - E. T. Parker:
An Inequality for Pseudo-Subplanes of Sets of Orthogonal Latin Squares. 76 - Bernt Lindström:
On Strong Joins and Pushout of Combinatorial Geometries. 77-79 - Alexander Schrijver:
A Short Proof of Minc's Conjecture. 80-83 - Scott A. Vanstone:
Pairwise "Orthogonal Generalized Room Squares" and Equidistant Permutation Arrays. 84-89 - L. Carlitz:
A Note on q-Eulerian Numbers. 90-94
Volume 25, Number 2, September 1978
- Eric Mendelsohn:
On the Groups of Automorphisms of Steiner Triple and Quadruple Systems. 97-104 - Frank K. Hwang, Shen Lin:
Distribution of Integers into k-tuples with Prescribed Conditions. 105-116 - Kevin T. Phelps:
Conjugate Orthogonal Quasigroups. 117-127 - A. C. Mukhopadhyay:
Some Infinite Classes of Hadamard Matrices. 128-141 - Harold Finkelstein, K. I. Mandelberg:
On Solutions of "Equations in Symmetric Groups". 142-152 - G. F. Clements:
The Minimal Number of Basic Elements in a Multiset Antichain. 153-162 - Dominique Perrin:
Le degré minimal du groupe d'un code bipréfixe fini. 163-173 - Keith R. Milliken:
Hindman's Theorem and Groups. 174-180 - David M. Jackson:
Some Results on "Product-Weighted Lead Codes". 181-187 - Dwight Duffus, Ivan Rival:
Separable Subsets of a Finite Lattice. 188-192 - Ronald D. Baker:
An Elliptic Semiplane. 193-195 - Wayne M. Dymàcek, D. P. Roselle:
Circular Permutations by Number of Rises and Successions. 196-201 - Robert A. Liebler:
A Note on the Hering-Ott Planes. 202-204 - Paul Erdös, George B. Purdy:
Some Combinatorial Problems in the Plane. 205-210
Volume 25, Number 3, November 1978
- Anthony V. Geramita, Joan M. Geramita:
Complex Orthogonal Designs. 211-225 - Philippe Delsarte:
Bilinear Forms over a Finite Field, with Applications to Coding Theory. 226-241 - I. Debroey, Joseph A. Thas:
On Semipartial Geometries. 242-250 - Craig M. Cordes:
A New Type of Combinatorial Design. 251-257 - Cheryl E. Praeger
:
Doubly Transitive Automorphism Groups of Block Designs. 258-266 - Eric Verheiden:
Integral and Rational Completions of Combinatorial Matrices. 267-276 - Richard Askey, Mourad E. H. Ismail, Tom Koornwinder:
Weighted Permutation Problems and Laguerre Polynomials. 277-287 - F. Jessie MacWilliams, Andrew M. Odlyzko, Neil J. A. Sloane, Harold N. Ward:
Self-Dual Codes over GF(4). 288-318 - László Lovász:
Kneser's Conjecture, Chromatic Number, and Homotopy. 319-324 - Imre Bárány:
A Short Proof of Kneser's Conjecture. 325-326
a service of 
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.
last updated on 2024-04-19 19:19 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
