Parcourir par
Collections
Sources
Geodesic
Parcourir par
Collections
Sources
The electronic journal of combinatorics
Tome 5 (1998)
Précédent
Suivant
Tome 5 (1998)
Sommaire
New symmetric designs from regular Hadamard matrices
Yury J. Ionin
Lattice walks in \({\mathbf Z}^ d\) and permutations with no long ascending subsequences
Ira Gessel
;
Jonathan Weinstein
;
Herbert S. Wilf
A construction for sets of integers with distinct subset sums
Tom Bohman
An improved bound on the minimal number of edges in color-critical graphs
Michael Krivelevich
Periodic sorting using minimum delay, recursively constructed merging networks
Edward A. Bender
;
S. Gill Williamson
Permutations which are the union of an increasing and a decreasing subsequence
M. D. Atkinson
All Ramsey numbers \(r(K_ 3,G)\) for connected graphs of order 9
Stephan Brandt
;
Gunnar Brinkmann
;
Thomas Harmuth
Multimatroids. II: Orthogonality, minors and connectivity
André Bouchet
A note on constructing large Cayley graphs of given degree and diameter by voltage assignments
Ljiljana Branković
;
Mirka Miller
;
Ján Plesník
;
Joe Ryan
;
Jozef Širáň
A binomial coefficient identity associated to a conjecture of Beukers
Scott Ahlgren
;
Shalosh B. Ekhad
;
Ken Ono
;
Doron Zeilberger
Maximising the permanent of \((0,1)\)-matrices and the number of extensions of Latin rectangles
B. D. McKay
;
I. M. Wanless
Increasing subsequences and the classical groups
E. M. Rains
Perfect matchings in \(\varepsilon\)-regular graphs
Noga Alon
;
Vojtech Rödl
;
Andrzej Ruciński
Lattice tilings by cubes: Whole, notched and extended
Mihail Kolountzakis
Asymptotics of the number of \(k\)-words with an \(l\)-descent
Amitai Regev
Minimal cycle bases of outerplanar graphs
Josef Leydold
;
Peter F. Stadler
Finite vector spaces and certain lattices
Thomas W. Cusick
Affine Weyl groups as infinite permutations
Henrik Eriksson
;
Kimmo Eriksson
A 2-coloring of \([1, N]\) can have \((1/22) N^2+O(N)\) monochromatic Schur triples, but not less
Aaron Robertson
;
Doron Zeilberger
On the number of descendants and ascendants in random search trees
Conrado Martínez
;
Alois Panholzer
;
Helmut Prodinger
Multi-static enumeration of two-stack sortable permutations
Mireille Bousquet-Mélou
On kissing numbers in dimensions 32 to 128
Yves Edel
;
E. M. Rains
;
N. J. A. Sloane
A note on the asymptotic and computational complexity of graph distinguishability
Alexander Russell
;
Ravi Sundaram
Short score certificates for upset tournaments
Jeffrey L. Poet
;
Bryan L. Shader
Recognizing circulant graphs of prime order in polynomial time
Mikhail E. Muzychuk
;
Gottfried Tinhofer
A bijective proof of Garsia's \(q\)-Lagrange inversion theorem
Dan W. Singer
Extremal infinite overlap-free binary words
Jean-Paul Allouche
;
James Currie
;
Jeffrey Shallit
Proof of the Alon-Tarsi conjecture for \(n=2^rp\)
Arthur A. Drisko
Some new Ramsey colorings
Geoffrey Exoo
Lattice paths between diagonal boundaries
Heinrich Niederhausen
The permutation classes equinumerous to the smooth class
Miklós Bóna
Durfee polynomials
E. Rodney Canfield
;
Sylvie Corteel
;
Carla D. Savage
A multivariate Lagrange inversion formula for asymptotic calculations
Edward A. Bender
;
L. Bruce Richmond
Crooked functions, bent functions, and distance regular graphs
T. D. Bending
;
D. Fon-Der-Flaass
On minimal words with given subword complexity
Ming-wei Wang
;
Jeffrey Shallit
Inclusion-exclusion and network reliability
Klaus Dohmen
Codes and projective multisets
Stefan Dodunekov
;
Juriaan Simonis
Combinatorial aspects of multiple zeta values
Jonathan M. Borwein
;
David M. Bradley
;
David J. Broadhurst
;
Petr Lisoněk
New bounds for union-free families of sets
Don Coppersmith
;
James B. Shearer
Counting Simplexes in
$R^3$
Claude Laflamme
;
István Szalkai
The average order of a permutation
Richard Stong
On noncrossing and nonnesting partitions for classical reflection groups
Christos A. Athanasiadis
Another infinite sequence of dense triangle-free graphs
Stephan Brandt
;
Tomaž Pisanski
Venn diagrams with few vertices
Bette Bultena
;
Frank Ruskey
A Macdonald Vertex Operator and Standard Tableaux Statistics
Mike Zabrocki
An exploration of the permanent-determinant method
Greg Kuperberg
Bijective recurrences concerning Schröder paths
Robert A. Sulanke
Constructions for cubic graphs with large girth
Norman Biggs