default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJournal of Combinatorial Theory, Series A, Volume 30
Volume 30, Number 1, January 1981
- J. S. Devitt, David M. Jackson:
Comma-free Codes: An Extension of Certain Enumerative Techniques to Recursively Defined Sequences. 1-18 - Leonidas J. Guibas, Andrew M. Odlyzko:
Periods in Strings. 19-42 - A. Sadam Hedayat, Gholamreza B. Khosrovshahi:
An Algebraic Study of BIB Designs: a Complete Solution for v = 6 and k = 3. 43-52 - Paul Erdös, George Mills:
Some Bounds for the Ramsey-Paris-Harrington Numbers. 53-70 - Emden R. Gansner:
The Hillman-Grassl Correspondence and the Enumeration of Reverse Plane Partitions. 71-89 - Anders Björner:
Homotopy Type of Posets and Lattice Complementation. 90-100 - Hai-Ping Ko, Stuart S.-S. Wang:
Supplement to Multiplier Theorems. 101-107 - Tom C. Brown:
On van der Waerden's Theorem and the Theorem of Paris and Harrington. 108-111 - Joel Spencer:
Coloring n-Sets Red and Blue. 112-113 - S. P. Townsend:
Every 5-Coloured Map in the Plane Contains a Monochrome Unit. 114-115
Volume 30, Number 2, March 1981
- József Beck:
On Positional Games. 117-133 - Hai-Ping Ko, Dijen K. Ray-Chaudhuri:
Multiplier Theorems. 134-157 - A. Tsarpalias:
A Combinatorial Theorem. 158-168 - Peter Frankl:
On a Problem of Chvátal and Erdös on Hypergraphs Containing No Generalized Simplex. 169-182 - Leonidas J. Guibas, Andrew M. Odlyzko:
String Overlaps, Pattern Matching, and Nontransitive Games. 183-208
Volume 30, Number 3, May 1981
- Neil J. A. Sloane, John G. Thompson:
The Nonexistence of a Certain Steiner System. 209-236 - Dennis E. White:
Some Connections between the Littlewood-Richardson. 237-247 - Phil Hanlon:
A Cycle Index Sum Inversion Theorem. 248-269 - Michio Ozeki:
Generalized Hadamard Matrices and Related Matrices and Their Applications to the Construction of the Positive Definite Integral Hermitian Forms. 270-275 - Dennis Stanton:
A Partially Ordered Set and q-Krawtchouk Polynomials. 276-284 - Noboru Hamada:
The Geometric Structure and the p-Rank of an Affine Triple System Derived from a Nonassociative Moufang Loop with the Maximum Associative Center. 285-297 - Hans-Dietrich O. F. Gronau:
On Sperner Families in Which No k Sets Have an Empty Intersection, II. 298-316 - Charles Laywine:
An Expression for the Number of Equivalence Classes of Latin Squares under Row and Column Permutations. 317-320 - Robert M. Freund, Michael J. Todd:
A Constructive Proof of Tucker's Combinatorial Lemma. 321-325 - Charles C. Lindner:
On the Number of Disjoint Mendelsohn Triple Systems. 326-330 - Nathan Linial:
Extending the Greene-Kleitman Theorem to Directed Graphs. 331-334 - Kenneth Baclawski, Anders Björner:
Fixed Points and Complements in Finite Lattices. 335-338 - Alan D. Taylor:
Bounds for the Disjoint Unions Theorem. 339-344 - Lajos Takács:
On a Combinatorial Theorem Related to a Theorem of G. Szegö. 345-348 - Joel Spencer:
Balancing Unit Vectors. 349-350 - Haim Mendelson:
On Permutations with Limited Repetition. 351-353
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 2026-09-01 03:22 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, funded, and maintained by:
Schloss Dagstuhl - Leibniz Center for Informatics is a member of the Leibniz Association and is funded by the federal government of Germany and the states of Germany, especially Saarland and Rhineland‑Palatinate.
