default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDThe Electronic Journal of Combinatorics, Volume 5
Volume 5, 1998
- Norman Biggs:
Constructions for Cubic Graphs with Large Girth.
- Yury J. Ionin:
New Symmetric Designs from Regular Hadamard Matrices. - Ira M. Gessel, Jonathan Weinstein, Herbert S. Wilf:
Lattice Walks in Zd and Permutations with No Long Ascending Subsequences. - Tom Bohman:
A Construction for Sets of Integers with Distinct Subset Sums. - Michael Krivelevich:
An Improved Bound on the Minimal Number of Edges in Color-Critical Graphs. - Edward A. Bender, S. Gill Williamson:
Periodic Sorting Using Minimum Delay, Recursively Constructed Merging Networks. - M. D. Atkinson:
Permutations which are the Union of an Increasing and a Decreasing Subsequence. - Stephan Brandt, Gunnar Brinkmann, Thomas Harmuth:
All Ramsey Numbers $r(K_3, G)$ For Connected Graphs of Order 9. - André Bouchet:
Multimatroids II. Orthogonality, minors and connectivity. - Ljiljana Brankovic
, Mirka Miller, Ján Plesník, Joseph F. Ryan, Jozef Sirán:
A Note on Constructing Large Cayley Graphs of Given Degree and Diameter by Voltage Assignments. - Scott Ahlgren, Shalosh B. Ekhad, Ken Ono, Doron Zeilberger:
A Binomial Coefficient Identity Associated to a Conjecture of Beukers. - Brendan D. McKay, Ian M. Wanless:
Maximising the Permanent of (0, 1)-Matrices and the Number of Extensions of Latin Rectangles. - Eric M. Rains:
Increasing Subsequences and the Classical Groups. - Noga Alon, Vojtech Rödl, Andrzej Rucinski:
Perfect Matchings in ε-regular Graphs. - Mihail N. Kolountzakis:
Lattice Tilings by Cubes: Whole, Notched and Extended. - Amitai Regev:
Asymptotics of the Number of k-words With An l-descent. - Josef Leydold, Peter F. Stadler:
Minimal Cycle Bases of Outerplanar Graphs. - Thomas W. Cusick:
Finite Vector Spaces and Certain Lattices. - Henrik Eriksson, Kimmo Eriksson:
Affine Weyl Groups as Infinite Permutations. - Aaron Robertson, Doron Zeilberger:
A 2-Coloring of [1, N] Can Have (1/22)N2+O(N) Monochromatic Schur Triples, But Not less! - Conrado Martinez, Alois Panholzer, Helmut Prodinger:
On the Number of Descendants and Ascendants in Random Search Trees. - Mireille Bousquet-Mélou:
Multi-statistic enumeration of two-stack sortable permutations. - Yves Edel, Eric M. Rains, Neil J. A. Sloane:
On Kissing Numbers in Dimensions 32 to 128. - Alexander Russell, Ravi Sundaram:
A Note on the Asymptotics and Computational Complexity of Graph Distinguishability. - Jeffrey L. Poet, Bryan L. Shader:
Short Score Certificates for Upset Tournaments. - Mikhail E. Muzychuk, Gottfried Tinhofer:
Recognizing Circulant Graphs of Prime Order in Polynomial Time. - Dan W. Singer:
A Bijective Proof of Garsia's q-Lagrange Inversion Theorem. - Jean-Paul Allouche, James D. Currie, Jeffrey O. Shallit:
Extremal Infinite Overlap-Free Binary Words. - Arthur A. Drisko:
Proof of the Alon-Tarsi Conjecture for n=2rp. - Geoffrey Exoo:
Some New Ramsey Colorings. - Heinrich Niederhausen:
Lattice Paths Between Diagonal Boundaries. - Miklós Bóna:
The Permutation Classes Equinumerous to the Smooth Class. - E. Rodney Canfield, Sylvie Corteel, Carla D. Savage:
Durfee Polynomials. - Edward A. Bender, L. Bruce Richmond:
A Multivariate Lagrange Inversion Formula for Asymptotic Calculations. - T. D. Bending, Dmitry Fon-Der-Flaass:
Crooked Functions, Bent Functions, and Distance Regular Graphs. - Ming-wei Wang, Jeffrey O. Shallit:
On Minimal Words With Given Subword Complexity. - Klaus Dohmen:
Inclusion-Exclusion and Network Reliability. - Stefan M. Dodunekov, Juriaan Simonis:
Codes and Projective Multisets. - Jonathan M. Borwein, David M. Bradley, David John Broadhurst, Petr Lisonek:
Combinatorial Aspects of Multiple Zeta Values. - Don Coppersmith, James B. Shearer:
New Bounds for Union-free Families of Sets. - Claude Laflamme, István Szalkai:
Counting Simplexes in R3. - Richard Stong:
The Average Order of a Permutation. - Christos A. Athanasiadis:
On Noncrossing and Nonnesting Partitions for Classical Reflection Groups. - Stephan Brandt, Tomaz Pisanski:
Another Infinite Sequence of Dense Triangle-Free Graphs. - Bette Bultena, Frank Ruskey:
Venn Diagrams with Few Vertices. - Mike Zabrocki:
A Macdonald Vertex Operator and Standard Tableaux Statistics. - Greg Kuperberg:
An Exploration of the Permanent-Determinant Method. - Robert A. Sulanke:
Bijective Recurrences concerning Schro"der Paths.
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 2025-02-21 19:38 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:
