default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJournal of Combinatorial Theory, Series A, Volume 86
Volume 86, Number 1, April 1999
- Noga Alon, Imre Z. Ruzsa:
Non-averaging Subsets and Non-vanishing Transversals. 1-13 - Rudolf Winkel:
Diagram Rules for the Generation of Schubert Polynomials. 14-48 - Laura Bader, Guglielmo Lunardon, Ivano Pinneri:
A New Semifield Flock. 49-62 - Mireille Bousquet-Mélou, Kimmo Eriksson
:
A Refinement of the Lecture Hall Theorem. 63-84 - Arnold Knopfmacher, John Knopfmacher:
Arithmetical Semigroups Related to Trees and Polyhedra. 85-102 - Mihai Ciucu, Christian Krattenthaler:
The Number of Centered Lozenge Tilings of a Symmetric Hexagon. 103-126 - Peter A. Hines:
On the Minimum Linear Complexity of de Bruijn Sequences over Non-prime Finite Fields. 127-139 - Zbigniew Lonc, Muktar E. Elzobi:
Chain Partitions of Products of Two Chains. 140-150 - William Y. C. Chen, James D. Louck:
Enumeration of Cubic Graphs by Inclusion-Exclusion. 151-157 - Russell Lyons, Robin Pemantle, Yuval Peres:
Resistance Bounds for First-Passage Percolation and Maximum Flow. 158-168 - Dmitry N. Kozlov:
A Class of Hypergraph Arrangements with Shellable Intersection Lattice. 169-176 - Menachem Kojman, Saharon Shelah:
Regressive Ramsey Numbers Are Ackermannian. 177-181 - Arvind Sankar, Sundar Vishwanathan:
Multilinear Polynomials and a Conjecture of Frankl and Füredi. 182-186 - Aart Blokhuis, Simeon Ball, Andries E. Brouwer, Leo Storme, Tamás Szonyi:
On the Number of Slopes of the Graph of a Function Defined on a Finite Field. 187-196 - Oleg Pikhurko:
Enumeration of Labelled (k, m)-Trees. 197-199 - S. Yu. Orevkov:
Asymptotic Number of Triangulations with Vertices in Z2 . 200-203
Volume 86, Number 2, May 1999
- Iliya Bluskov, Katherine Heinrich:
General Upper Bounds on the Minimum Size of Covering Designs. 205-213 - Randall McCutcheon:
An Infinitary Polynomial van der Waerden Theorem. 214-231 - Marco Buratti, Fulvio Zuanni:
On Singular 1-Rotational Steiner 2-Designs. 232-244 - Nathan Lulov, Boris G. Pittel:
On the Random Young Diagrams and Their Cores. 245-280 - Dan Saracino:
On a Combinatorial Problem from the Model Theory of Wreath Products, I. 281-305 - Dan Saracino:
On a Combinatorial Problem from the Model Theory of Wreath Products, II. 306-322 - Brendan D. McKay, Ian M. Wanless:
Most Latin Squares Have Many Subsquares. 323-347 - Yanxun Chang, Giovanni Lo Faro:
Intersection Numbers of Kirkman Triple Systems. 348-361 - Udo Ott:
Local Weight Enumerators for Binary Self-Dual Codes. 362-381 - Mihai Ciucu:
The Equivalence between Enumerating Cyclically Symmetric, Self-Complementary and Totally Symmetric, Self-Complementary Plane Partitions. 382-389 - Kevin W. J. Kadell:
An Injection for the Ehrenpreis Rogers-Ramanujan Problem. 390-394 - Mauro Biliotti, Eliana Francot:
Parameters for Sets of Type (m, n) in Projective Planes of Prime Power Order. 395-400
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-07-30 00:03 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.
