default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDEuropean Journal of Combinatorics, Volume 4
Volume 4, Number 1, March 1983
- József Beck:
On a Geometric Problem of Erdös, Sárkozy, and Szermerédi Concerning Vector Sums. 1-10 - Anders Björner, James W. Walker:
A Homotopy Complementation Formula for Partially Ordered Sets. 11-19 - Peter Frankl, János Pach:
On the Number of Sets in a Null t-Design. 21-23 - Chris D. Godsil
:
The Automorphism Groups of Some Cubic Cayley Graphs. 25-32 - Dean G. Hoffman:
Completing Incomplete Commutative Latin Squares With Prescribed Diagonals. 33-35 - Peter J. Lorimer:
Vertex-transitive Graphs of Valency 3. 37-44 - Jeffrey B. Remmel, Roger Whitney:
A Bijective Proof of the Hook Formula for the Number of Column Strict Tableaux with Bounded Entries. 45-63 - Michael Walker:
On Central Root Automorphisms of Finite Generalized Octagons. 65-86 - M. L. H. Willems:
Optimal Codes, Laguerre and Special Laguerre i-Structures. 87-92 - M. L. H. Willems, Joseph A. Thas:
A Note on the Existence of Special Laguerre i-Structures and Optimal Codes. 93-96
Volume 4, Number 2, June 1983
- Béla Bollobás:
Almost all Regular Graphs are Hamiltonian. 97-106 - Arjeh M. Cohen:
On a Theorem of Cooperstein. 107-126 - Pierre Duchet, Henry Meyniel:
Ensemble Convexes dans les Graphes I: Théorèmes de Helly et de Radon pour Graphes et Surfaces. 127-132 - Ludwig Elsner, Charles R. Johnson, J. A. Ross, Johanan Schönheim:
On a Generalized Matching Problem Arising in Estimating the Eigenvalue Variation of Two Matrices. 133-136 - Phil Hanlon:
A Proof of a Conjecture of Stanley Concerning Partitions of a Set. 137-141 - Jaroslav Jezek, Jaroslav Nezetril:
Ramsey Varieties. 143-147 - Brendan D. McKay:
Spanning Trees in Regular Graphs. 149-160 - Heinrich Niederhausen:
The Ballot Problem with Three Candidates. 161-167 - James G. Oxley:
On the Numbers of Bases and Circuits in Simple Binary Matroids. 169-178 - Attila Sali:
Stronger Form of an M-Part Sperner Theorem. 179-183 - François Zara:
Sur les Couples Fischeriens de Largeur 1. 185-199
Volume 4, Number 3, September 1983
- Ron Aharoni:
Menger's Theorem for Graphs Containing no Infinite Paths. 201-204 - Marcel Duboué:
Une Suite Récurrente Remarquable. 205-214 - Peter Frankl, Andrew M. Odlyzko:
On Subsets with Cardinalities of Intersections Divisible by a Fixed Integer. 215-220 - J. Gillis, Doron Zeilberger:
A Direct Combinatorial Proof of a Positivity Result. 221-223 - Ian P. Goulden, David M. Jackson:
An Inversion Model for q-Identities. 225-230 - Jerrold R. Griggs, Jeffrey C. Lagarias, Andrew M. Odlyzko, James B. Shearer:
On the Tightest Packing of Sums of Vectors. 231-236 - Irith Ben-Arroyo Hartman:
Long Cycles Generate the Cycle Space of a Graph. 237-246 - Masakazu Jimbo:
Cyclic Neofields and Cyclic Steiner 2-Designs with Block Size 4. 247-254 - Jaroslav Nesetril, R. Paninski, H. Sachs:
An Extremal Problem on v-Partite Graphs. 255-262 - Emanuela Ughi:
On the Number of Points of Elliptic Curves over a Finite Field and a Problem of B. Segre. 263-270 - M. L. H. Willems, J. Depunt:
Semi Laguerre Planes. 271-277
Volume 4, Number 4, December 1983
- J. L. Brenner, R. C. Lyndon:
The Orbits of the Product of Two Permutations. 279-293 - Ulrich Faigle:
Optimal Matchings in Posets. 295-303 - Dominique Foata, Jacques Labelle:
Modèles Combinatoires pour les Polynômes de Meixner. 305-311 - Peter Frankl, Navin M. Singhi:
Linear Dependencies among Subsets of a Finite Set. 313-318 - François Jaeger:
Graphes de Cordes et Espaces Graphiques. 319-327 - Gábor Korchmáros:
New Examples of Complete k-Arcs in PG(2, q). 329-334 - Charles C. Lindner, Anne Penfold Street:
Construction of Large Sets of Pairwise Disjoint Transitive Triple Systems. 335-346 - Geoffrey Mason:
Orthogonal Geometries over GF(2) and actions of Extra-special 2-Groups on Translation Planes. 347-357 - Norbert Polat:
Sur une Extension du Théorème de Menger aux Graphes Infinis. 359-365 - Pasquale Quattrocchi:
A Class of Maximal Permutation Cliques. 367-369 - Jeffrey B. Remmel:
A Note on a Recursion for the Number of Derangements. 371-374 - Egon Schulte:
On Arranging Regular Incidence-Complexes as Faces of Higher-Dimensional Ones. 375-384 - Endre Szemerédi, William T. Trotter:
A Combinatorial Distinction Between the Euclidean and Projective Planes. 385-394
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 2025-12-05 22:39 CET 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:
