The Electronic Journal of Combinatorics, Volume 4
Volume 4, Number 1, 1997
- Michael Avidon: On Primitive 3-smooth Partitions of n.
- Edward A. Bender, E. Rodney Canfield: The Fraction of Subspaces of GF(q) n with a Specified Number of Minimal Weight Vectors is Asymptotically Poisson.
- Volkmar Welker: Colored Partitions and a Generalization of the Braid Arrangement.
- Paolo Papi: Affine Permutations and Inversion Multigraphs.
- Patrick Solé: Codes, Lattices, and Steiner Systems.
- Willem H. Haemers: Disconnected Vertex Sets and Equidistant Code Pairs.
- András Gyárfás: Fruit Salad.
- Philippe Vismara: Union of all the Minimum Cycle Bases of a Graph.
- David A. Grable: On Random Greedy Triangle Packing.
- Gary Gordon: A beta Invariant for Greedoids and Antimatroids.
- William F. Doran IV: A Plethysm Formula for pmu circ hlambda .
- Allan Adler: Magic N-Cubes Form a Free Monoid.
- Edward J. Barbeau, John J. Chew III, Stephen M. Tanny: A Matrix Dynamics Approach to Golomb's Recursion.
- Anant P. Godbole, Ben Lamorte, Erik Jonathan Sandquist: Threshold Functions for the Bipartite Tura'n property.
- V. Y. Dobrynin: On the Function "Sandwiched" between alpha(G) and chi(G) .
- Gilles Schaeffer: Bijective Census and Random Generation of Eulerian Planar Maps With Prescribed Degrees.
- Miguel Angel Fiol: Some Applications of the Proper and Adjacency Polynomials in the Theory of Graph Spectra.
- Katherine St. John: Limit Probabilities for Random Sparse Bit Strings.
- Svante Janson: Hook Lengths in a Skew Young Diagram.
- Andrew Shapira: An Exact Performance Bound for an O(m+n) Greedy Matching Procedure.
- W. Edwin Clark, Larry A. Dunning: Tight Upper Bounds for the Domination Numbers of Graphs With Given Order and Minimum Degree.
- Christian Krattenthaler: Determinant Identities and a Generalization of the Number of Totally Symmetric Self-complementary Plane Partitions.
- Lior Pachter: Combinatorial Approaches and Conjectures for 2-Divisibility Problems Concerning Domino Tilings of Polyominoes.
- Miguel Angel Fiol: An Eigenvalue Characterization of Antipodal Distance Regular Graphs.
Volume 4, Number 2, 1997
- Noga Alon, Daniel J. Kleitman: A purely combinatorial proof of the Hadwiger Debrunner (p, q) Conjecture.
- Jonathan M. Borwein, David M. Bradley, David John Broadhurst: Evaluations of k-fold Euler/Zagier sums: a compendium of results for arbitrary k.
- E. Rodney Canfield: From recursions to asymptotics: on Szekeres' formula for the number of partitions.
- Aviezri S. Fraenkel: Combinatorial game theory foundations applied to digraph kernels.
- Ira M. Gessel: Generating functions and generalized Dedekind sums.
- Andrew M. Odlyzko, James B. Shearer, Ryan C. Siders: Monotonic subsequences in dimensions higher than one.
- James Gary Propp: Generating random elements of finite distributive lattices.
- Walter Shur: The Last Digit of (2n choose n) and Sigma(n choose i)(2n-2i choose n-i).
- Doris Schattschneider: Escher's combinatorial patterns.
- Frank W. Schmidt, Rodica Simion: Some geometric probability problems involving the Eulerian numbers.
- Joel H. Spencer: Real time asymptotic packing.
- Richard P. Stanley: Parking functions and noncrossing partitions.
- Marko Petkovsek, Herbert S. Wilf: When can the sum of (1/p)th of the binomial coefficients have closed form?
- Doron Zeilberger: Dodgson's Determinant-Evaluation Rule Proved by TWO-TIMING MEN and WOMEN.
- Dan Davis: On a tiling scheme from M. C. Escher.
data released under the ODC-BY 1.0 license. See also our legal information page
last updated on 2013-06-18T211851 by the dblp team