default search action
Journal of Combinatorial Theory, Series A, Volume 17
Volume 17, Number 1, July 1974
- Neil Hindman:
Finite Sums from Sequences Within Cells of a Partition of N. 1-11 - William H. Burge:
Four Correspondences Between Graphs and Generalized Young Tableaux. 12-30 - Branko Grünbaum:
Vertices Missed by Longest Paths or Circuits. 31-38 - Earl S. Kramer:
Some Mutually Disjoint Steiner Systems. 39-43 - L. H. Harper:
The Morphology of Partially Ordered Sets. 44-58 - H. J. Ryser:
Subsets of a Finite Set That Intersect Each Other in At Most One Element. 59-77 - Elmo Moore:
Generalized Euler-Type Partition Identities. 78-83 - Frank K. Hwang, Shen Lin:
A Direct Method to Construct Triple Systems. 84-94 - Mark Yoseloff:
Topologic Proofs of Some Combinatorial Theorems. 95-111 - Allan B. Cruse:
On the Finite Completion of Partial Latin Cubes. 112-119 - David Perin:
A Combinatorial Property of Rank 3 Permutation Groups. 120-124 - H. J. Ryser:
A Theorem on Block Designs. 125-128 - Paul Erdös:
Remark on a Theorem of Lindström. 129-130 - George B. Purdy:
Spheres Tangent to All the Faces of a Simplex. 131-133 - James E. Baumgartner:
Improvement of a Partition Theorem of Erdös and Rado. 134-137 - Karsten Steffens:
Injective Choice Functions. 138-144
Volume 17, Number 2, September 1974
- Basil Gordon, Theodore S. Motzkin, Lloyd R. Welch:
Permanents of 0, 1-Matrices. 145-155 - Joseph Blum:
Enumeration of the Square Permutations in Sn. 156-161 - J. S. Byrnes:
On a Partition Problem of Frobenius. 162-166 - Chong-Yun Chao:
A Test for Conjugacy of Partitions of Finite Sets. 167-172 - William M. Kantor:
Dimension and Embedding Theorems for Geometric Lattices. 173-195 - Hiroshi Narushima:
Principle of Inclusion-Exclusion on Semilattices. 196-203 - Charles C. Lindner:
A Simple Construction of Disjoint and Almost Disjoint Steiner Triple Systems. 204-209 - David Lubell:
Orthogonal Structures on Finite Partial Orders. 210-218 - Anne Penfold Street, Earl Glen Whitehead Jr.:
Group Ramsey Theory. 219-226 - G. F. Clements:
Inequalities Concerning Numbers of Subsets of a Finite Set. 227-244 - David E. Daykin, Jean Godfrey, Anthony J. W. Hilton:
Existence Theorems for Sperner Families. 245-251 - David E. Daykin:
A Simple Proof of the Kruskal-Katona Theorem. 252-253 - David E. Daykin:
Erdös-Ko-Rado from Kruskal-Katona. 254-255 - L. Carlitz:
Remark on a Combinatorial Identity. 256-257 - H. O. Foulkes:
On a Combinatorial Lemma Relating to Standard Tableaux. 258 - Andrzej Ehrenfeucht, Jan Mycielski:
On Families of Intersecting Sets. 259-260 - Edward T. H. Wang:
A New Class of Finite Cyclic Permanent Groups. 261-264 - Gyula O. H. Katona:
Solution of a Problem of A. Ehrenfeucht and J. Mycielski. 265-266 - E. T. Parker:
A Latin Square with Orthogonal Mate and No Automorphism. 267-268 - Sanpei Kageyama:
On the Incomplete Block Designs Derivable from the Association Schemes. 269-272 - Edward A. Bender:
On Buckhiester's Enumeration of n x n Matrices. 273-274
Volume 17, Number 3, November 1974
- Haim Hanani:
On Resolvable Balanced Incomplete Block Designs. 275-289 - Terrence J. Brown:
Transversal Theory and F-Products. 290-298 - Kenneth B. Gross:
Equivalence of Room Designs. II. 299-316 - Frederic W. Shultz:
A Characterization of State Spaces of Orthomodular Lattices. 317-328 - Joel Spencer:
Puncture Sets. 329-336 - William T. Trotter:
Irreducible Posets with Large Height Exist. 337-344 - H. Hadwiger, P. Mani:
On Polyhedra with Extremal Euler Characteristic. 345-349 - M. R. Damerell, E. C. Milner:
Necessary and Sufficient Conditions for Transversals of Countable Set Systems. 350-374 - Michael Goldberg:
The Space-Filling Pentahedra II. 375-378 - W. D. Wallis:
Solution of the Room Square Existence Problem. 379-383 - James E. Baumgartner:
A Short Proof of Hindman's Theorem. 384-386 - Hans S. Witsenhausen:
On a Set Puncturing Problem. 387-390
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.