| 0 | -- | 0 | Michael E. Hoffman. An Analogue of Covering Space Theory for Ranked Posets |
| 0 | -- | 0 | Yury J. Ionin. Applying Balanced Generalized Weighing Matrices to Construct Block Designs |
| 0 | -- | 0 | Ömer Egecioglu, Timothy Redmond, Charles Ryavec. From a Polynomial Riemann Hypothesis to Alternating Sign Matrices |
| 0 | -- | 0 | Alexander K. Kelmans, Dhruv Mubayi, Benny Sudakov. Asymptotically Optimal Tree-Packings in Regular Graphs |
| 0 | -- | 0 | Doron Zeilberger. The Umbral Transfer-Matrix Method. IV. Counting Self-Avoiding Polygons and Walks |
| 0 | -- | 0 | Giovanni Lo Faro, Lorenzo Milazzo, Antoinette Tripodi. On the Upper and Lower Chromatic Numbers of BSQSs(16) |
| 0 | -- | 0 | Xuding Zhu. Circular Chromatic Number of Planar Graphs of Large Odd Girth |
| 0 | -- | 0 | Anthony Bonato, Wolf H. Holzmann, Hadi Kharaghani. Hadamard Matrices and Strongly Regular Graphs with the 3-e.c. Adjacency Property |
| 0 | -- | 0 | Patric R. J. Östergård, William D. Weakley. Values of Domination Numbers of the Queen s Graph |
| 0 | -- | 0 | Mark Shimozono, Dennis E. White. A Color-to-Spin Domino Schensted Algorithm |
| 0 | -- | 0 | Ralph Howard, Gyula Károlyi, László A. Székely. Towards a Katona Type Proof for the 2-intersecting Erdos-Ko-Rado Theorem |
| 0 | -- | 0 | Andrzej Czygrinow, Genghua Fan, Glenn Hurlbert, Henry A. Kierstead, William T. Trotter. Spanning Trees of Bounded Degree |
| 0 | -- | 0 | Mikhail E. Muzychuk, Gottfried Tinhofer. Recognizing Circulant Graphs in Polynomial Time: An Application of Association Schemes |
| 0 | -- | 0 | Ben Wieland, Anant P. Godbole. On the Domination Number of a Random Graph |
| 0 | -- | 0 | János Barát, Péter Hajnal. The Arc-Width of a Graph |
| 0 | -- | 0 | Grant Cairns. Queens on Non-square Tori |
| 0 | -- | 0 | Bojan Mohar, Riste Skrekovski. Nowhere-zero k-flows of Supergraphs |
| 0 | -- | 0 | Stefan Felsner. The Skeleton of a Reduced Word and a Correspondence of Edelman and Greene |
| 0 | -- | 0 | David Bruce Wilson. Diagonal Sums of Boxed Plane Partitions |
| 0 | -- | 0 | Thomas Niessen. How to Find Overfull Subgraphs in Graphs with Large Maximum Degree, II |
| 0 | -- | 0 | Ulrich Tamm. Some Aspects of Hankel Matrices in Coding Theory and Combinatorics |
| 0 | -- | 0 | L. J. Cummings, M. Mays. A One-Sided Zimin Construction |
| 0 | -- | 0 | Bruce E. Sagan, John S. Caughman IV. The Multiplicities of a Dual-thin Q-polynomial Association Scheme |
| 0 | -- | 0 | Mark Skandera. Dumont s Statistic on Words |
| 0 | -- | 0 | Jeffrey Shallit, Ming-wei Wang. Weakly Self-Avoiding Words and a Construction of Friedman |
| 0 | -- | 0 | E. Rodney Canfield. Meet and Join within the Lattice of Set Partitions |
| 0 | -- | 0 | Jason Bandlow, Kendra Killpatrick. An Area-to-Inv Bijection Between Dyck Paths and 312-avoiding Permutations |
| 0 | -- | 0 | Alex Brodsky, Stephane Durocher, Ellen Gethner. The Rectilinear Crossing Number of K::10:: is 62 |
| 0 | -- | 0 | Gábor N. Sárközy, Stanley M. Selkow. On Edge Colorings with at Least q Colors in Every Subset of p Vertices |
| 0 | -- | 0 | D. de Caen. A Note on the Ranks of Set-Inclusion Matrices |
| 0 | -- | 0 | Eric Vigoda. A Note on the Glauber Dynamics for Sampling Independent Sets |
| 0 | -- | 0 | Andrew Granville, J. L. Selfridge. Product of Integers in an Interval, Modulo Squares |
| 0 | -- | 0 | Yair Caro, Cecil C. Rousseau. Asymptotic Bounds for Bipartite Ramsey Numbers |
| 0 | -- | 0 | Michael Plantholt, Shailesh K. Tipnis. All Regular Multigraphs of Even Order and High Degree Are 1-factorable |
| 0 | -- | 0 | Dan Singer. On Catalan Trees and the Jacobian Conjecture |
| 0 | -- | 0 | Irène Charon, Iiro S. Honkala, Olivier Hudry, Antoine Lobstein. General Bounds for Identifying Codes in Some Infinite Regular Graphs |
| 0 | -- | 0 | Chunhui Lai. A Lower Bound for the Number of Edges in a Graph Containing No Two Cycles of the Same Length |
| 0 | -- | 0 | Yifan Yang. On a Multiplicative Partition Function |
| 0 | -- | 0 | Ara Aleksanyan, Mihran Papikian. On Coset Coverings of Solutions of Homogeneous Cubic Equations over Finite Fields |
| 0 | -- | 0 | Markus Fulmek, Michael Kleber. Bijective Proofs for Schur Function Identities which Imply Dodgson s Condensation - Formula and Plu cker Relations |
| 0 | -- | 0 | Alain Lascoux. About Division by 1 |
| 0 | -- | 0 | Matthias Beck, Ira M. Gessel, Takao Komatsu. The Polynomial Part of a Restricted Partition Function Related to the Frobenius Problem |
| 0 | -- | 0 | Daniel Kobler, André Kündgen. Gaps in the Chromatic Spectrum of Face-Constrained Plane Graphs |
| 0 | -- | 0 | James Gary Propp. A Reciprocity Theorem for Domino Tilings |
| 0 | -- | 0 | Philippe Chassaing, Jean-François Marckert. Parking Functions, Empirical Processes, and the Width of Rooted Labeled Trees |
| 0 | -- | 0 | Gaetano Quattrocchi. Colouring 4-cycle Systems with Specified Block Colour Patterns: the Case of Embedding P::3::-designs |
| 0 | -- | 0 | Richard P. Anstee, Ron Ferguson, Attila Sali. Small Forbidden Configurations II |
| 0 | -- | 0 | Fan R. K. Chung, Ronald L. Graham, Frank Thomson Leighton. Guessing Secrets |
| 0 | -- | 0 | Jenny Alvarez, Miguel Amadis, George Boros, Dagan Karp, Victor H. Moll, Leobardo Rosales. An Extension of a Criterion for Unimodality |
| 0 | -- | 0 | Zdenek Dvorak, Daniel Král. On Planar Mixed Hypergraphs |
| 0 | -- | 0 | Leigh Roberts. A Unified View of Determinantal Expansions for Jack Polynomials |