default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDEuropean Journal of Combinatorics, Volume 2
Volume 2, Number 1, March 1981
- Miklós Ajtai, János Komlós, Endre Szemerédi:
A Dense Infinite Sidon Sequence. 1-11 - Béla Bollobás, Andrew Thomason:
Graphs which Contain all Small Graphs. 13-15 - Richard A. Brualdi:
On Haber's Minimum Term Rank Formula. 17-20 - Marlene J. Colbourn, Charles J. Colbourn:
Cyclic Block Designs With Block Size 3. 21-26 - A. P. Hillman, R. M. Grassl:
Polynomial Ring Generated by Tableau Shapes. 27-39 - S. A. Joni:
Umbralized Umbral Operators. 41-53 - Germain Kreweras, Heinrich Niederhausen:
Solution of an Enumerative Problem Connected with Lattice Paths. 55-60 - Bernt Lindström:
Matroids on the Bases of Simple Matroids. 61-63 - Bernt Lindström:
On Matroids and Sperner's Lemma. 65-66 - Don Rawlings:
Generalized Worpitzky Identities with Applications to Permutation Enumeration. 67-78 - Joseph A. Thas, Stanley E. Payne:
Generalized Quadrangles and the Higman-Sims Technique. 79-89 - Thomas Zaslavsky
:
Complementary Matching Vectors and the Uniform Matching Extension Property. 91-103
Volume 2, Number 2, June 1981
- Tom Brylawski, James G. Oxley:
The Broken-circuit Complex: Its Structure and Factorizations. 107-121 - Peter Frankl:
On Large Vector Systems with Equal Scalar Products. 123-125 - Peter Frankl, Ivo G. Rosenberg:
A Finite Set Intersection Theorem. 127-129 - Ian P. Goulden, David M. Jackson:
The Enumeration of Directed Closed Euler Trails and Directed Hamiltonian Circuits by Lagrangian Methods. 131-135 - François Jaeger:
A Constructive Approach to the Critical Problem for Matroids. 137-144 - Gyula O. H. Katona:
Sums of Vectors and Turán's Problem for 3-graphs. 145-154 - Germain Kreweras:
Permutations Partiellement Soulignées et Polynômes Géométriques. 155-163 - Arnold Neumaier:
Distance Matrices and n-dimensional Designs. 165-172 - Nicolas Percsy:
Une Condition Nécessaire et Suffisante de Plongeabilité pour les Treillis Semi-modulaires. 173-177 - Alain Poli, Michel Ventou:
Codes Autoduaux Principaux et Groupe d'Automorphismes de l'Algèbre A = F2r, [X1, -, Xn]/(X12 - 1, -, Xn2 -1). 179-183 - C. R. Pranesachar:
Some Formulae for the Number of SDRs and Symbolic Representations. 185-191 - Alan P. Sprague:
Incidence Structures whose Planes are Nets. 193-204
Volume 2, Number 3, September 1981
- Lucien Bénéteau:
Les Systèmes Triples de Hall de Dimension 4. 205-212 - Albrecht Beutelspacher, Anne Delandtsheer:
A Common Characterization of Finite Projective Spaces and Affine Planes. 213-219 - Jeffrey H. Dinitz, Douglas R. Stinson:
The Spectrum of Room Cubes. 221-230 - Lars Holst:
On Numbers Related to Partitions of Unlike Objects and Occupancy Problems. 231-237 - William M. Kantor:
Some Geometries that are Almost Buildings. 239-247 - Christiane Lefèvre-Percsy:
Quadrilatères Généralisés Faiblement Plongés dans PG(3, q). 249-255 - Paul D. Seymour:
Matroids and Multicommodity Flows. 257-290 - Joel Spencer:
Discrete Ham Sandwich Theorems. 291-298 - Joseph A. Thas:
New Combinatorial Characterizations of Generalized Quadrangles. 299-303 - Thomas Zaslavsky:
Correction to "Complementary Matching Vectors and the Uniform Matching Extension Property". 305
Volume 2, Number 4, December 1981
- Louis J. Billera, Carl W. Lee:
The Numbers of Faces of Polytope Pairs and Unbounded Polyhedra. 307-322 - Andries E. Brouwer, Hanfried Lenz:
Subspaces of Linear Spaces of Line Size 4. 323-330 - Robert Cori, Antonio Machi, Jean-Guy Penaud, Bernard Vauquelin:
On the Automorphism Group of a Planar Hypermap. 331-334 - Jean-Paul Doignon:
Minimum Numbers of Circuits in Affine Sets. 335-338 - Michael J. Ganley:
Central Weak Nucleus Semifields. 339-347 - Yahya Ould Hamidoune:
An Application of Connectivity Theory in Graphs to Factorizations of Elements in Groups. 349-355 - János Pach:
A Problem of Ulam on Planar Graphs. 357-361 - Miklós Simonovits, Vera T. Sós:
Intersection Properties of Subsets of Integers. 363-372 - James W. Walker:
Homotopy Type and Euler Characteristic of Partially Ordered Sets. 373-384 - Sergey Yuzvinsky:
Linear Representations of Posets, their Cohomology and a Bilinear Form. 385-397
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-08-29 00:16 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.
