Table of Contents
Research Papers
| Packing Graphs: The Packing Problem Solved | |
| Yair Caro, Raphael Yuster | R1 |
| On Primitive 3-smooth Partitions of $n$ | |
| Michael Avidon | R2 |
| The Fraction of Subspaces of $\mathrm{GF}(q)^n$ with a Specified Number of Minimal Weight Vectors is Asymptotically Poisson | |
| Edward A. Bender, E. Rodney Canfield | R3 |
| Colored partitions and a Generalization of the Braid Arrangement | |
| Volkmar Welker | R4 |
| Affine Permutations and Inversion Multigraphs | |
| Paolo Papi | R5 |
| Codes, Lattices and Steiner Systems | |
| Patrick Solé | R6 |
| Disconnected Vertex Sets and Equidistant Code Pairs | |
| Willem H. Haemers | R7 |
| Fruit Salad | |
| András Gyárfás | R8 |
| Union of all the Minimum Cycle Bases of a Graph | |
| Philippe Vismara | R9 |
| Efficient Covering Designs of the Complete Graph | |
| Yair Caro, Raphael Yuster | R10 |
| On Random Greedy Triangle Packing | |
| David A. Grable | R11 |
| Short Certificates for Tournaments | |
| Noga Alon, Miklós Ruszinkó | R12 |
| A $\beta$ Invariant for Greedoids and Antimatroids | |
| Gary Gordon | R13 |
| A Plethysm Formula for $p_\mu(\underline{x}) \circ h_\lambda(\underline{x})$ | |
| William F. Doran IV | R14 |
| Magic N-Cubes Form a Free Monoid | |
| Allan Adler | R15 |
| A Matrix Dynamics Approach to Golomb's Recursion | |
| Edward J. Barbeau, John Chew, Stephen Tanny | R16 |
| Analysis of an Asymmetric Leader Election Algorithm | |
| Svante Janson, Wojciech Szpankowski | R17 |
| Threshold Functions for the Bipartite Turán Property | |
| Anant P. Godbole, Ben Lamorte, Erik Jonathan Sandquist | R18 |
| On the function "sandwiched" between $\alpha(G)$ and $\overline{\chi}(G)$ | |
| V. Y. Dobrynin | R19 |
| Bijective Census and Random Generation of Eulerian Planar Maps with Prescribed Vertex Degrees | |
| Gilles Schaeffer | R20 |
| Some Applications of the Proper and Adjacency Polynomials in the Theory of Graph Spectra | |
| M. A. Fiol | R21 |
| Asymptotics of Young Diagrams and Hook Numbers | PDF COMMENT |
| Amitai Regev, Anatoly Vershik | R22 |
| Limit Probabilities for Random Sparse Bit Strings | |
| Katherine St. John | R23 |
| Hook lengths in a skew Young diagram | |
| Svante Janson | R24 |
| An Exact Performance Bound for an ${O (m+n)}$ Time Greedy Matching Procedure | |
| Andrew Shapira | R25 |
| Tight Upper Bounds for the Domination Numbers of Graphs with Given Order and Minimum Degree | |
| W. Edwin Clark, Larry A. Dunning | R26 |
| Determinant identities and a generalization of the number of totally symmetric self-complementary plane partitions | |
| C. Krattenthaler | R27 |
| Frankl-Füredi Type Inequalities for Polynomial Semi-lattices | |
| Jin Qian, Dijen K. Ray-Chaudhuri | R28 |
| Combinatorial Approaches and Conjectures for 2-Divisibility Problems Concerning Domino Tilings of Polyominoes | |
| Lior Pachter | R29 |
| An Eigenvalue Characterization of Antipodal Distance-Regular Graphs | |
| M. A. Fiol | R30 |
ISSN: 1077-8926