Parcourir par
Collections
Sources
Geodesic
Parcourir par
Collections
Sources
The electronic journal of combinatorics
Tome 8 (2001)
Précédent
Suivant
Sommaire du
Fascicule no. 1
Hadamard matrices and strongly regular graphs with the 3-e. c. adjacency property
Anthony Bonato
;
W. H. Holzmann
;
Hadi Kharaghani
On Catalan trees and the Jacobian conjecture
Dan Singer
A unified view of determinantal expansions for Jack polynomials
Leigh Roberts
Small forbidden configurations. II
Richard Anstee
;
Ron Ferguson
;
Attila Sali
Product of integers in an interval, modulo squares
Andrew Granville
;
J. L. Selfridge
On the upper and lower chromatic numbers of BSQSs(16)
Giovanni Lo Faro
;
Lorenzo Milazzo
;
Antoinette Tripodi
How to find overfull subgraphs in graphs with large maximum degree. II
Thomas Niessen
A note on the Glauber dynamics for sampling independent sets
Eric Vigoda
On edge colorings with at least \(q\) colors in every subset of \(p\) vertices
Gábor N. Sárközy
;
Stanley Selkow
The skeleton of a reduced word and a correspondence of Edelman and Green
Stefan Felsner
Dumont's statistic on words
Mark Skandera
Applying balanced generalized weighing matrices to construct block designs
Yury J. Ionin
Guessing secrets
Fan Chung
;
Ronald Graham
;
Tom Leighton
Parking functions, empirical processes, and the width of rooted labeled trees
Philippe Chassaing
;
Jean-François Marckert
Meet and join within the lattice of set partitions
E. Rodney Canfield
Bijective proofs for Schur function identities which imply Dodgson's condensation formula and Plücker relations
Markus Fulmek
;
Michael Kleber
Asymptotic bounds for bipartite Ramsey numbers
Yair Caro
;
Cecil Rousseau
A reciprocity theorem for domino tilings
James Propp
On a multiplicative partition function
Yifan Yang
Nowhere-zero \(k\)-flows of supergraphs
Bojan Mohar
;
Riste Škrekovski
A color-to-spin domino Schensted algorithm
Mark Shimozono
;
Dennis E. White
On coset coverings of solutions of homogeneous cubic equations over finite fields
Ara Aleksanyan
;
Mihran Papikian
The rectilinear crossing number of \(K_{10}\) is 62
Alex Brodsky
;
Stephane Durocher
;
Ellen Gethner
Colouring \(4\)-cycle systems with specified block colour patterns: The case of embedding \(P_3\)-designs
Gaetano Quattrocchi
Circular chromatic number of planar graphs of large odd girth
Xuding Zhu
Recognizing circulant graphs in polynomial time: An application of association schemes
Mikhail E. Muzychuk
;
Gottfried Tinhofer
A one-sided Zimin construction
L. J. Cummings
;
M. Mays
The umbral transfer-matrix method. IV: Counting self-avoiding polygons and walks
Doron Zeilberger
Values of domination numbers of the queen's graph
Patric R. J. Östergård
;
William D. Weakley
An extension of a criterion for unimodality
Jenny Alvarez
;
Miguel Amadis
;
George Boros
;
Dagan Karp
;
Victor H. Moll
;
Leobardo Rosales
Towards a Katona type proof for the \(2\)-intersecting Erdős-Ko-Rado theorem
Ralph Howard
;
Gyula Károlyi
;
László A. Székely
An analogue of covering space theory for ranked posets
Michael E. Hoffman
Spanning trees of bounded degree
Andrzej Czygrinow
;
Genghua Fan
;
Glenn Hurlbert
;
H. A. Kierstead
;
William T. Trotter
The arc-width of a graph
János Barát
;
Péter Hajnal
On planar mixed hypergraphs
Zdeněk Dvořák
;
Daniel Král'
From a polynomial Riemann hypothesis to alternating sign matrices
Ömer Eğecioğlu
;
Timothy Redmond
;
Charles Ryavec
On the domination number of a random graph
Ben Wieland
;
Anant P. Godbole
Asymptotically optimal tree-packings in regular graphs
Alexander Kelmans
;
Dhruv Mubayi
;
Benny Sudakov
General bounds for identifying codes in some infinite regular graphs
Irène Charon
;
Iiro Honkala
;
Olivier Hudry
;
Antoine Lobstein
An area-to-inv bijection between Dyck paths and 312-avoiding permutations
Jason Bandlow
;
Kendra Killpatrick
All regular multigraphs of even order and high degree are 1-factorable
Michael J. Plantholt
;
Shailesh K. Tipnis
Diagonal sums of boxed plane partitions
David B. Wilson
Weakly self-avoiding words and a construction of Friedman
Jeffrey Shallit
;
Ming-wei Wang
Gaps in the chromatic spectrum of face-constrained plane graphs
Daniel Kobler
;
André Kündgen
The multiplicities of a dual-thin \(Q\)-polynomial association scheme
Bruce E. Sagan
;
John S. Caughman, IV
A note on the ranks of set-inclusion matrices
D. de Caen
Queens on non-square tori
Grant Cairns
The polynomial part of a restricted partition function related to the Frobenius problem
Matthias Beck
;
Ira M. Gessel
;
Takao Komatsu
About division by 1
Alain Lascoux
A lower bound for the number of edges in a graph containing no two cycles of the same length
Chunhui Lai
Some aspects of Hankel matrices in coding theory and combinatorics
Ulrich Tamm
Sommaire du
Fascicule no. 2
The Fraenkel Festschrift volume
Aviezri Fraenkel: A brief biography
Shaula Fraenkel
Aviezri Fraenkel and combinatorial games
Richard K. Guy
Aviezri Fraenkel's work in number theory
Jamie Simpson
Against all Odds: The amazing but most true story of Aviezri Fraenkel and his special favorite: The responsa project or the multi-faceted contributions of Aviezri Fraenkel to information retrieval and the related areas
Yaacov Choueka
The game of End-Nim
Michael H. Albert
;
Richard J. Nowakowski
Optimal token allocation in solitaire knock'm down
Arthur T. Benjamin
;
Matthew T. Fluet
;
Mark L. Huber
Six lonely runners
Tom Bohman
;
Ron Holzman
;
Dan Kleitman
Dartboard arrangements
G. L. Cohen
;
E. Tonkes
Computing evolutionary chains in musical sequences
Maxime Crochemore
;
Costas S. Iliopoulos
;
Yoan J. Pinzon
A well-rounded linear function
Roger B. Eggleton
Pairs of disjoint \(q\)-element subsets far from each other
Hikoe Enomoto
;
Gyula O. H. Katona
A finite word poset
Péter L. Erdős
;
Péter Sziklai
;
David C. Torney
Another form of matrix Nim
Thomas S. Ferguson
The subword complexity of a two-parameter family of sequences
Aviezri S. Fraenkel
;
Tamar Seeman
;
Jamie Simpson
The hexad game
Joseph Kahane
;
Alexander J. Ryba
Competitive colorings of oriented graphs
H. A. Kierstead
;
W. T. Trotter
A simple card guessing game revisited
Arnold Knopfmacher
;
Helmut Prodinger
On the oriented game chromatic number
J. Nešetřil
;
E. Sopena
Sumsets of finite Beatty sequences
Jane Pitman
Combinatorial identities from the spectral theory of quantum graphs
Holger Schanz
;
Uzy Smilansky
The tenacity of zero-one laws
Joel H. Spencer
;
Katherine St. John
How Berger, Felzenbaum and Fraenkel revolutionized Covering Systems the same way that George Boole revolutionized Logic
Doron Zeilberger