Parcourir par
Collections
Sources
Geodesic
Parcourir par
Collections
Sources
The electronic journal of combinatorics
Tome 11 (2004)
no. 1
Précédent
Suivant
Tome 11 (2004) no. 1
Sommaire
On rainbow arithmetic progressions
Maria Axenovich
;
Dmitri Fon-Der-Flaass
Venn diagrams and symmetric chain decompositions in the Boolean lattice
Jerrold Griggs
;
Charles E. Killian
;
Carla D. Savage
Minuscule heaps over Dynkin diagrams of type \(\widetilde A\)
Manabu Hagiwara
Graphic and protographic lists of integers
Dmitry Fon-Der-Flaass
;
Douglas B. West
Discrepancy of cartesian products of arithmetic progressions
Benjamin Doerr
;
Anand Srivastav
;
Petra Wehr
Fans and bundles in the graph of pairwise sums and products
Lorenz Halbeisen
On regular factors in regular graphs with small radius
Arne Hoffmann
;
Lutz Volkmann
Strings with maximally many distinct subsequences and substrings
Abraham Flaxman
;
Aram W. Harrow
;
Gregory B. Sorkin
A combinatorial proof of the sum of \(q\)-cubes
Kristina C. Garrett
;
Kristen Hummel
There exist binary circular \(5/2^+\) power free words of every length
Ali Aberkane
;
James D. Currie
The plethysm \(s_\lambda[s_\mu]\) at hook and near-hook shapes
T. M. Langley
;
J. B. Remmel
Chromatically unique multibridge graphs
F. M. Dong
;
K. L. Teo
;
C. H. C. Little
;
M. Hendy
;
K. M. Koh
On the counting of fully packed loop configurations: some new conjectures
J.-B. Zuber
On the entropy and letter frequencies of ternary square-free words
Christoph Richard
;
Uwe Grimm
Lattice structures from planar graphs
Stefan Felsner
Cyclic labellings with constraints at two distances
R. A. Leese
;
S. D. Noble
Improved bounds on the length of maximal abelian square-free words
Evan M. Bullock
Equilateral triangles in finite metric spaces
Vania Mascioni
On feasible sets of mixed hypergraphs
Daniel Král
Goldberg-Coxeter construction for 3- and 4-valent plane graphs
Mathieu Dutour
;
Michel Deza
A card shuffling analysis of deformations of the Plancherel measure of the symmetric group
Jason Fulman
On a combinatorial problem of Asmus Schmidt
W. Zudilin
Class-uniformly resolvable group divisible structures. I: Resolvable group divisible designs
Peter Danziger
;
Brett Stevens
Class-uniformly resolvable group divisible structures. II: Frames
Peter Danziger
;
Brett Stevens
Decomposing infinite 2-connected graphs into 3-connected components
R. Bruce Richter
Coloring with no 2-colored \(P_4\)'s
Michael O. Albertson
;
Glenn G. Chappell
;
H. A. Kierstead
;
André Kündgen
;
Radhika Ramamurthi
Steiner triple systems intersecting in pairwise disjoint blocks
Yeow Meng Chee
Weighted Aztec diamond graphs and the Weyl character formula
Georgia Benkart
;
Oliver Eng
On the Livingstone-Wagner theorem.
V. B. Mnukhin
;
I. J. Siemons
On the combinatorial structure of arrangements of oriented pseudocircles
Johann Linhart
;
Ronald Ortner
A scaling result for explosive processes
M. Mitzenmacher
;
R. Oliveira
;
J. Spencer
Enumerative problems inspired by Mayer's theory of cluster integrals
Pierre Leroux
Dense packings of equal spheres in a cube
Th. Gensane
Airy phenomena and analytic combinatorics of connected graphs
Philippe Flajolet
;
Bruno Salvy
;
Gilles Schaeffer
Constructive lower bounds on classical multicolor Ramsey numbers
Xu Xiaodong
;
Xie Zheng
;
Geoffrey Exoo
;
Stanisław P. Radziszowski
\(q\)-exponential families
Kent E. Morrison
Even astral configurations
Leah Wrenn Berman
On the associative Nijenhuis relation
Kurusch Ebrahimi-Fard
Permutations avoiding arithmetic patterns
Peter Hegarty
Ground state incongruence in 2D spin glasses revisited
Martin Loebl
Satisfiability and computing van der Waerden numbers
Michael R. Dransfield
;
Lengning Liu
;
Victor W. Marek
;
Mirosław Truszczyński
Degree powers in graphs with forbidden subgraphs
Béla Bollobás
;
Vladimir Nikiforov
Bijections and congruences for generalizations of partition identities of Euler and Guy
James A. Sellers
;
Andrew V. Sills
;
Gary L. Mullen
Classification of six-point metrics
Bernd Sturmfels
;
Josephine Yu
Operations on well-covered graphs and the Roller-Coaster conjecture
Philip Matchett
Vertex-partitioning into fixed additive induced-hereditary properties is NP-hard
Alastair Farrugia
On a generalization of binomial coefficients
Frédéric Jouhet
;
Bodo Lass
;
Jiang Zeng
A bijective proof of Borchardt's identity
Dan Singer
Partition identities. I: Sandwich theorems and logical 0-1 laws
Jason P. Bell
;
Stanley N. Burris
Antichains on three levels
Paulette Lieby
Multiple pattern avoidance with respect to fixed points and excedances
Sergi Elizalde
On the chromatic number of intersection graphs of convex sets in the plane
Seog-Jin Kim
;
Alexandr Kostochka
;
Kittikorn Nakprasit
The Markov-WZ method
Mohamud Mohammed
;
Doron Zeilberger
Generalizing Narayana and Schröder numbers to higher dimensions
Robert A. Sulanke
Uniform edge distribution in hypergraphs is hereditary
Dhruv Mubayi
;
Vojtĕch Rödl
A \(\lambda\)-ring Frobenius characteristic for \(G\wr S_n\)
Anthony Mendes
;
Jeffrey Remmel
;
Jennifer Wagner
On-line Ramsey theory
J. A. Grytczuk
;
M. Hałuszczak
;
H. A. Kierstead
A fast algorithm for MacMahon's partition analysis
Guoce Xin
Convergence in distribution for subset counts between random sets
Dudley Stark
On the generation and enumeration of some classes of convex polyominoes
A. Del Lungo
;
E. Duchi
;
A. Frosini
;
S. Rinaldi
A positive proof of the Littlewood-Richardson rule using the octahedron recurrence
Allen Knutson
;
Terence Tao
;
Christopher Woodward
Random Cayley graphs are expanders: a simple proof of the Alon-Roichman theorem
Zeph Landau
;
Alexander Russell
Distinguishing numbers for graphs and groups
Julianna Tymoczko
A bijection between classes of fully packed loops and plane partitions
P. Di Francesco
;
P. Zinn-Justin
;
J.-B. Zuber
Flag vectors of multiplicial polytopes
Margaret M. Bayer
Short cycles in random regular graphs
Brendan D. McKay
;
Nicholas C. Wormald
;
Beata Wysocka
Bottom Schur functions
Peter Clifford
;
Richard P. Stanley
Conjectured combinatorial models for the Hilbert series of generalized diagonal harmonic modules
Nicholas A. Loehr
;
Jeffrey B. Remmel
Planar maps as labeled mobiles
J. Bouttier
;
P. Di Francesco
;
E. Guitter
The degree of the splitting field of a random polynomial over a finite field
John D. Dixon
;
Daniel Panario
{\(q\)}-analogues of the sums of consecutive integers, squares, cubes, quarts and quints
Michael Schlosser
Secret sharing schemes on sparse homogeneous access structures with rank three
Jaume Martí-Farré
;
Carles Padró
The cube recurrence
Gabriel D. Carroll
;
David Speyer
The cd-index of Bruhat intervals.
Nathan Reading
Directed subgraph complexes
Axel Hultman
Standard paths in another composition poset
Jan Snellman
On the graphs of Hoffman-Singleton and Higman-Sims
Paul R. Hafner
Reconstructing integer sets from their representation functions
Vsevolod F. Lev
Pólya's permanent problem
William McCuaig
Packing densities of patterns
Reid W. Barton
Outerplanar crossing numbers, the circular arrangement problem and isoperimetric functions
Éva Czabarka
;
Ondrej Sýkora
;
László A. Székely
;
Imrich Vrťo
A uniformly distributed statistic on a class of lattice paths
David Callan
Mac{M}ahon-type identities for signed even permutations
Dan Bernstein
Rook theory, generalized {S}tirling numbers and {\((p,q)\)}-analogues
J. B. Remmel
;
Michelle L. Wachs
Bonferroni-Galambos inequalities for partition lattices
Klaus Dohmen
;
Peter Tittmann
Half-simple symmetric Venn diagrams
Charles E. Killian
;
Frank Ruskey
;
Carla D. Savage
;
Mark Weston
On some non-holonomic sequences
Stefan Gerhold
Enumerative formulae for unrooted planar maps: a pattern
Valery A. Liskovets
Nonexistence results for Hadamard-like matrices
Justin D. Christian
;
Bryan L. Shader
Voltage graphs, group presentations and cages
Geoffrey Exoo
Bounds on the Turán density of PG(3, 2)
Sebastian M. Cioabă
Dominance order and graphical partitions
Axel Kohnert
On the functions with values in \([\alpha (G), \overline{\chi} (G)]\)
V. Dobrynin
;
M. Pliskin
;
E. Prosolupov
Two new criteria for comparison in the Bruhat order
Brian Drake
;
Sean Gerrish
;
Mark Skandera
When can you tile a box with translates of two given rectangular bricks?
Richard J. Bower
;
T. S. Michael
An answer to a question by Wilf on packing distinct patterns in a permutation
Micah Coleman
Tight estimates for eigenvalues of regular graphs
A. Nilli
Colored Prüfer codes for \(k\)-edge colored trees
Manwon Cho
;
Dongsu Kim
;
Seunghyun Seo
;
Heesung Shin
Propagation of mean degrees
Dieter Rautenbach
Rectilinear spanning trees versus bounding boxes
D. Rautenbach
On the {\(q\)}-analogue of the sum of cubes
S. Ole Warnaar
{\(n\)}-color partition theoretic interpretations of some mock theta functions
A. K. Agarwal
A binomial coefficient identity associated with Beukers' conjecture on {A}péry numbers
Wenchang Chu
Filling a box with translates of two bricks
Mihail N. Kolountzakis