Table of contents for Volume 2 of the Electronic Journal of
Combinatorics
Articles
Research Papers
-
R1: David W. Farmer, Counting distinct zeros of the Riemann zeta-function
-
R2: Aviezri S. Fraenkel and R. Jamie Simpson, How Many Squares Must a Binary Sequence Contain?
-
R3: Herbert S. Wilf, The Problem of the Kings
-
R4: Peter J. Cameron, Counting Two-graphs Related to Trees
-
R5: Gara Pruesse and Frank Ruskey,
The Prism of the Acyclic Orientation Graph is Hamiltonian
-
R6: Kimmo Eriksson and Svante Linusson,
The size of Fulton's essential set
-
R7: Henrik Eriksson, Pebblings
-
R8: C. D. Godsil,
Algebraic Matching Theory
-
R9: E. F. Assmus, Jr.
On 2-ranks of Steiner triple systems
-
R10: Michael Albert, Alan Frieze and Bruce Reed,
Multicoloured Hamilton Cycles
-
R11: Tiffany M. Barnes and Carla D. Savage,
A Recurrence for Counting Graphical Partitions
-
R12: James B. Shearer,
Some New Optimum Golomb Rectangles
-
R13: C. Krattenthaler,
Bijective proofs of the hook formulas for the number of
standard Young tableaux, ordinary and shifted
-
R14: Iztok Hozo,
The eigenvalues of the Laplacian for the homology of the
Lie algebra corresponding to a poset
-
R15: László Lovász and Peter Winkler,
Exact Mixing in an Unknown Markov Chain
-
R16: Frederic Maire,
On the shadow of squashed families of k-sets
-
R17: Carl Droms, Brigitte Servatius and Herman Servatius,
The Structure of Locally Finite Two-Connected Graphs
-
R18: Michael Larsen,
The Problem of Kings
-
R19: Colin Cooper and Alan Frieze,
Multicoloured Hamilton cycles in random graphs; an anti-Ramsey
threshold
-
R20: Garth Isaak,
Tournaments as Feedback Arc Sets
-
R21:James D. Currie,
A Note on Antichains of Words
-
R22: R. Balasubramanian and K. Soundararajan,
Maximal Sets of Integers with Distinct Divisors
-
R23: Mark D. McKerihan,
Matrices connected with Brauer's centralizer algebras
-
R24: M. D. Atkinson, S. A. Linton and L. A. Walker
Priority Queues and Multisets
-
R25: Victor Reiner, The distribution of descents and length in a Coxeter group
Notes
Features