Parcourir par
Collections
Sources
Geodesic
Parcourir par
Collections
Sources
The electronic journal of combinatorics
Tome 4 (1997)
Précédent
Suivant
Sommaire du
Fascicule no. 1
Packing graphs: The packing problem solved
Yair Caro
;
Raphael Yuster
On primitive 3-smooth partitions of \(n\).
Michael Avidon
The fraction of subspaces of \(\text{GF}(q)^ n\) with a specified number of minimal weight vectors is asymptotically Poisson
Edward A. Bender
;
E. Rodney Canfield
Colored partitions and a generalization of the braid arrangement
Volkmar Welker
Affine permutations and inversion multigraphs
Paolo Papi
Codes, lattices, and Steiner systems
Patrick Solé
Disconnected vertex sets and equidistant code pairs
Willem H. Haemers
Fruit salad
András Gyárfás
Union of all the minimum cycle bases of a graph
Philippe Vismara
Efficient covering designs of the complete graph
Yair Caro
;
Raphael Yuster
On random greedy triangle packing
David A. Grable
Short certificates for tournaments
Noga Alon
;
Miklós Ruszinkó
A \(\beta\) invariant for greedoids and antimatroids
Gary Gordon
A plethysm formula for \(p_ \mu(\underline x)\circ h_ \lambda(\underline x)\)
William F. Doran IV
Magic \(N\)-cubes form a free monoid
Allan Adler
A matrix dynamics approach to Golomb's recursion
Edward J. Barbeau
;
John Chew
;
Stephen Tanny
Analysis of an asymmetric leader election algorithm
Svante Janson
;
Wojciech Szpankowski
Threshold functions for the bipartite Turán property
Anant P. Godbole
;
Ben Lamorte
;
Erik Jonathan Sandquist
On the function ``sandwiched'' between \(\alpha(G)\) and \(\bar\chi (G)\)
V. Y. Dobrynin
Bijective census and random generation of Eulerian planar maps with prescribed vertex degrees
Gilles Schaeffer
Some applications of the proper and adjacency polynomials in the theory of graph spectra
M. A. Fiol
Asymptotics of Young diagrams and hook numbers
Amitai Regev
;
Anatoly Vershik
Limit probabilities for random sparse bit strings
Katherine St. John
Hook lengths in a skew Young diagram
Svante Janson
An exact performance bound for an \(O(m+n)\) time greedy matching procedure
Andrew Shapira
Tight upper bounds for the domination numbers of graphs with given order and minimum degree
W. Edwin Clark
;
Larry A. Dunning
Determinant identities and a generalization of the number of totally symmetric self-complementary plane partitions
C. Krattenthaler
Frankl-Füredi Type Inequalities for Polynomial Semi-lattices
Jin Qian
;
Dijen K. Ray-Chaudhuri
Combinatorial approaches and conjectures for 2-divisibility problems concerning domino tilings of polyominoes
Lior Pachter
An eigenvalue characterization of antipodal distance-regular graphs
M. A. Fiol
Sommaire du
Fascicule no. 2
The Wilf Festschrift volume
A tribute to Herbert S. Wilf in celebration of his 65th birthday
Fan Chung
;
Joan Hutchinson
Full Text
A purely combinatorial proof of the Hadwiger Debrunner \((p,q)\) conjecture
N. Alon
;
D. J. Kleitman
Ramanujan's method in \(q\)-series congruences
George E. Andrews
;
Ranjan Roy
Hypergeometric series acceleration via the WZ method
Tewodros Amdeberhan
;
Doron Zeilberger
A note on major sequences and external activity in trees
Janet S. Beissinger
;
Uri N. Peled
Evaluations of \(k\)-fold Euler/Zagier sums: a compendium of results for arbitrary \(k\)
J. M. Borwein
;
D. M. Bradley
;
D. J. Broadhurst
From recursions to asymptotics: On Szekeres' formula for the number of partitions
E. Rodney Canfield
Random walks on generating sets for finite groups
F. R. K. Chung
;
R. L. Graham
On cycles in the coprime graph of integers
Paul Erdős
;
Gabor N. Sarkozy
Basic calculus of signed permutations. II: Finite analogues of Bessel functions
Dominique Foata
;
Guo-Niu Han
Combinatorial game theory foundations applied to digraph kernels
Aviezri S. Fraenkel
Generating functions and generalized Dedekind sums.
Ira Gessel
Shape tiling
Kevin Keating
;
Jonathan L. King
New upper bounds on the order of cages
F. Lazebnik
;
V. A. Ustimenko
;
A. J. Woldar
Monotonic subsequences in dimensions higher than one
A. Odlyzko
;
J. B. Shearer
;
R. Siders
Generating random elements of finite distributive lattices
James Propp
The Last Digit of
${2n \choose n}$
and
$\sum {n \choose i}{2n-2i \choose n-i}$
Walter Shur
Escher's combinatorial patterns
Doris Schattschneider
Some geometric probability problems involving the Eulerian numbers
Frank Schmidt
;
Rodica Simion
Real time asymptotic packing
Joel Spencer
Parking functions and noncrossing partitions
Richard P. Stanley
When can the sum of \((1/p)\)th of the binomial coefficients have closed form
Marko Petkovšek
;
Herbert S. Wilf
Dodgon's determinant-evaluation rule proved by TWO-TIMING MEN and WOMEN
Doron Zeilberger
On a tiling scheme from M. C. Escher
Dan Davis