default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDThe Electronic Journal of Combinatorics, Volume 4
Volume 4, Number 1, 1997
- Yair Caro, Raphael Yuster:
Packing Graphs: The packing problem solved. - 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. - Yair Caro, Raphael Yuster:
Efficient Covering Designs of the Complete Graph. - David A. Grable:
On Random Greedy Triangle Packing. - Noga Alon, Miklós Ruszinkó:
Short Certificates for Tournaments. - 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. - Svante Janson, Wojciech Szpankowski:
Analysis of an Asymmetric Leader Election Algorithm. - 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. - Amitai Regev, Anatoly M. Vershik:
Asymptotics of Young Diagrams and Hook Numbers. - 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. - William 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. - Jin Qian, Dijen K. Ray-Chaudhuri:
Frankl-Füredi Type Inequalities for Polynomial Semi-lattices. - 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
- Fan R. K. Chung, Joan Hutchinson:
A Tribute to Herbert S.Wilf.
- Noga Alon, Daniel J. Kleitman:
A purely combinatorial proof of the Hadwiger Debrunner (p, q) Conjecture. - George E. Andrews, R. Roy:
Ramanujan's method in q-series congruences. - Tewodros Amdeberhan, Doron Zeilberger:
Hypergeometric series acceleration via the WZ method. - Janet Simpson Beissinger, Uri N. Peled:
A note on major sequences and external activity in trees. - 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. - Fan R. K. Chung, Ronald L. Graham:
Random walks on generating sets for finite groups. - Paul Erdös, Gábor N. Sárközy:
On cycles in the coprime graph of integers. - Dominique Foata, Guo-Niu Han:
Calcul basique des permutations signées, II. - Aviezri S. Fraenkel:
Combinatorial game theory foundations applied to digraph kernels. - Ira M. Gessel:
Generating functions and generalized Dedekind sums. - Kevin Keating, Jonathan L. King:
Shape tiling. - Felix Lazebnik, Vasiliy A. Ustimenko, Andrew J. Woldar:
New upper bounds on the order of cages. - 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.
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2024-11-04 20:47 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
