Volume 8(1), 2001

   Research Papers

• R1: Anthony Bonato, W. H. Holzmann, Hadi Kharaghani
  • Hadamard Matrices and Strongly Regular Graphs with the 3-e.c. Adjacency Property
  abstract | ps | pdf
• R2: Dan Singer
  • On Catalan Trees and the Jacobian Conjecture
  abstract | ps | pdf
• R3: Leigh Roberts
  • A Unified View of Determinantal Expansions for Jack Polynomials
  abstract | ps | pdf
• R4: Richard Anstee, Ron Ferguson, Attila Sali
  • Small Forbidden Configurations II
  abstract | ps | pdf
• R5: Andrew Granville and J.L. Selfridge
  • Product of Integers in an Interval, Modulo Squares
  abstract | ps | pdf
• R6: Giovanni Lo Faro, Lorenzo Milazzo, Antoinette Tripodi
  • On the Upper and Lower Chromatic Numbers of BSQSs(16)
  abstract | ps | pdf
• R7: Thomas Niessen
  • How to Find Overfull Subgraphs in Graphs with Large Maximum Degree, II
  abstract | ps | pdf
• R8: Eric Vigoda
  • A Note on the Glauber Dynamics for Sampling Independent Sets
  abstract | ps | pdf
• R9: Gábor N. Sárközy, Stanley Selkow
  • On Edge Colorings with at Least q Colors in Every Subset of p Vertices
  abstract | ps | pdf
• R10: Stefan Felsner
  • The Skeleton of a Reduced Word and a Correspondence of Edelman and Greene
  abstract | ps | pdf
• R11: Mark Skandera
  • Dumont's Statistic on Words
  abstract | ps | pdf
• R12: Yury J. Ionin
  • Applying Balanced Generalized Weighing Matrices to Construct Block Designs
  abstract | ps | pdf
• R13: Fan Chung, Ronald Graham, Tom Leighton
  • Guessing Secrets
  abstract | ps | pdf
• R14: Philippe Chassaing and Jean-François Marckert
  • Parking Functions, Empirical Processes, and the Width of Rooted Labeled Trees
  abstract | ps | pdf
• R15: E. Rodney Canfield
  • Meet and Join within the Lattice of Set Partitions
  abstract | ps | pdf
• R16: Markus Fulmek and Michael Kleber
  • Bijective Proofs for Schur Function Identities which Imply Dodgson's Condensation
    Formula and Plücker Relations
  abstract | ps | pdf
• R17: Yair Caro and Cecil Rousseau
  • Asymptotic Bounds for Bipartite Ramsey Numbers
  abstract | ps | pdf
• R18: James Propp
  • A Reciprocity Theorem for Domino Tilings
  abstract | ps | pdf
• R19: Yifan Yang
  • On a Multiplicative Partition Function
  abstract | ps | pdf
• R20: Bojan Mohar and Riste Skrekovski
  • Nowhere-zero k-flows of Supergraphs
  abstract | ps | pdf
• R21: Mark Shimozono and Dennis E. White
  • A Color-to-Spin Domino Schensted Algorithm
  abstract | ps | pdf
• R22: Ara Aleksanyan and Mihran Papikian
  • On Coset Coverings of Solutions of Homogeneous Cubic Equations over Finite Fields
  abstract | ps | pdf
• R23: Alex Brodsky, Stephane Durocher and Ellen Gethner
  • The Rectilinear Crossing Number of K₁₀ is 62
  abstract | ps | pdf
• R24: Gaetano Quattrocchi
  • Colouring 4-cycle Systems with Specified Block Colour Patterns: the Case of Embedding P₃-designs
  abstract | ps | pdf
• R25: Xuding Zhu
  • Circular Chromatic Number of Planar Graphs of Large Odd Girth
  abstract | ps | pdf
• R26: Mikhail E. Muzychuk and Gottfried Tinhofer
  • Recognizing Circulant Graphs in Polynomial Time: An Application of Association Schemes
  abstract | ps | pdf
• R27: L. J. Cummings and M. Mays
  • A One-Sided Zimin Construction
  abstract | ps | pdf
• R28: Doron Zeilberger
  • The Umbral Transfer-Matrix Method. IV. Counting Self-Avoiding Polygons and Walks
  abstract | ps | pdf
• R29: Patric R. J. Östergård and William D. Weakley
  • Values of Domination Numbers of the Queen's Graph
  abstract | ps | pdf | comment
• R30: Jenny Alvarez, Miguel Amadis, George Boros, Dagan Karp,
           Victor H. Moll and Leobardo Rosales
  • An Extension of a Criterion for Unimodality
  abstract | ps | pdf
• R31: Ralph Howard, Gyula Károlyi and László A. Székely
  • Towards a Katona Type Proof for the 2-intersecting Erdos-Ko-Rado Theorem
  abstract | ps | pdf
• R32: Michael E. Hoffman
  • An Analogue of Covering Space Theory for Ranked Posets
  abstract | ps | pdf
• R33: Andrzej Czygrinow, Genghua Fan, Glenn Hurlbert, H. A. Kierstead and William T. Trotter
  • Spanning Trees of Bounded Degree
  abstract | ps | pdf
• R34: János Barát and Péter Hajnal
  • The Arc-Width of a Graph
  abstract | ps | pdf
• R35: Zdenek Dvorák and Daniel Král'
  • On Planar Mixed Hypergraphs
  abstract | ps | pdf
• R36: Ömer Egecioglu, Timothy Redmond and Charles Ryavec
  • From a Polynomial Riemann Hypothesis to Alternating Sign Matrices
  abstract | ps | pdf
• R37: Ben Wieland and Anant P. Godbole
  • On the Domination Number of a Random Graph
  abstract | ps | pdf
• R38: Alexander Kelmans, Dhruv Mubayi and Benny Sudakov
  • Asymptotically Optimal Tree-Packings in Regular Graphs
  abstract | ps | pdf
• R39: Irène Charon, Iiro Honkala, Olivier Hudry and Antoine Lobstein
  • General Bounds for Identifying Codes in Some Infinite Regular Graphs
  abstract | ps | pdf
• R40: Jason Bandlow and Kendra Killpatrick
  • An Area-to-Inv Bijection Between Dyck Paths and 312-avoiding Permutations
  abstract | ps | pdf | Comments
• R41: Michael J. Plantholt and Shailesh K. Tipnis
  • All Regular Multigraphs of Even Order and High Degree Are 1-factorable
  abstract | ps | pdf

   Articles

• A1: Ulrich Tamm
  • Some Aspects of Hankel Matrices in Coding Theory and Combinatorics
  abstract | ps | pdf

   Notes

• N1: David B. Wilson
  • Diagonal Sums of Boxed Plane Partitions
  abstract | ps | pdf
• N2: Jeffrey Shallit and Ming-wei Wang
  • Weakly Self-Avoiding Words and a Construction of Friedman
  abstract | ps | pdf
• N3: Daniel Kobler and André Kündgen
  • Gaps in the Chromatic Spectrum of Face-Constrained Plane Graphs
  abstract | ps | pdf
• N4: Bruce E. Sagan and John S. Caughman, IV
  • The Multiplicities of a Dual-thin Q-polynomial Association Scheme
  abstract | ps | pdf
• N5: D. de Caen
  • A Note on the Ranks of Set-Inclusion Matrices
  abstract | ps | pdf
• N6: Grant Cairns
  • Queens on Non-square Tori
  abstract | ps | pdf
• N7: Matthias Beck, Ira M. Gessel and Takao Komatsu
  • The Polynomial Part of a Restricted Partition Function Related to the Frobenius Problem
  abstract | ps | pdf
• N8: Alain Lascoux
  • About Division by 1
  abstract | ps | pdf
• N9: Chunhui Lai
  • A Lower Bound for the Number of Edges in a Graph Containing No Two Cycles of the Same Length
  abstract | ps | pdf

 E-JC Home

  Copyright 1994-2001 The Electronic Journal of Combinatorics. All rights reserved.