Parcourir par
Collections
Sources
Geodesic
Parcourir par
Collections
Sources
The electronic journal of combinatorics
Tome 13 (2006)
Précédent
Suivant
Combinatorics of partial derivatives
Michael Hardy
A combinatorial approach to evaluation of reliability of the receiver output for BPSK modulation with spatial diversity
S. Bliudze
;
D. Krob
Bounded-degree graphs have arbitrarily large geometric thickness
János Barát
;
Jiří Matoušek
;
David R. Wood
Inversions within restricted fillings of Young tableaux
Sarah Iveson
Discrepancy of sums of three arithmetic progressions
Aleš Přívětivý
Adding layers to bumped-body polyforms with minimum perimeter preserves minimum perim\-eter
Winston C. Yang
More forbidden minors for wye-delta-wye reducibility
Yaming Yu
Descendants in increasing trees
Markus Kuba
;
Alois Panholzer
The linear complexity of a graph
David L. Neel
;
Michael E. Orrison
A few more cyclic Steiner 2-designs
Kejun Chen
;
Ruizhong Wei
On computing the distinguishing numbers of trees and forests
Christine T. Cheng
Sets of points determining only acute angles and some related colouring problems
David Bevan
Rainbow \(H\)-factors
Raphael Yuster
New upper bound for a class of vertex Folkman numbers
N. Kolev
;
N. Nenov
Tilings by translation: enumeration by a rational language approach
Srecko Brlek
;
Andrea Frosini
;
Simone Rinaldi
;
Laurent Vuillon
The distinguishing chromatic number
Karen L. Collins
;
Ann N. Trenk
Combinatorics of the free Baxter algebra
Marcelo Aguiar
;
Walter Moreira
Lyndon words and transition matrices between elementary, homogeneous and monomial symmetric functions
Andrius Kulikauskas
;
Jeffrey Remmel
\(H\)-free graphs of large minimum degree
Noga Alon
;
Benny Sudakov
Orthogonal art galleries with holes: a coloring proof of Aggarwal's theorem
Paweł Żyliński
Covering codes for Hats-on-a-line
Sarang Aravamuthan
;
Sachin Lodha
A permutation regularity lemma
Joshua N. Cooper
Counting \(d\)-polytopes with \(d+3\) vertices
Éric Fusy
Some plethysm results related to Foulkes' conjecture
Steven Sivek
On the limiting distribution for the length of the longest alternating sequence in a random permutation
Harold Widom
Meta-Fibonacci sequences, binary trees and extremal compact codes
Brad Jackson
;
Frank Ruskey
Some results on odd astral configurations
Leah Wrenn Berman
Monochromatic and zero-sum sets of nondecreasing modified diameter
David Grynkiewicz
;
Rasheed Sabar
Constructive upper bounds for cycle-saturated graphs of minimum size
Ronald Gould
;
Tomasz Łuczak
;
John Schmitt
A note on domino shuffling
É. Janvresse
;
T. de la Rue
;
Y. Velenik
Completion of the Wilf-classification of 3-5 pairs using generating trees
Mark Lipson
The strongly regular (45,\,12,\,3,\,3) graphs
Kris Coolsaet
;
Jan Degraer
;
Edward Spence
Distribution of crossings, nestings and alignments of two edges in matchings and partitions
Anisse Kasraoui
;
Jiang Zeng
A matrix representation of graphs and its spectrum as a graph invariant
David Emms
;
Edwin R. Hancock
;
Simone Severini
;
Richard C. Wilson
Optimal Penney Ante strategy via correlation polynomial identities
Daniel Felix
On subgraphs induced by transversals in vertex-partitions of graphs
Maria Axenovich
A Gessel--Viennot-type method for cycle systems in a directed graph
Christopher R. H. Hanusa
Tensorial square of the hyperoctahedral group coinvariant space
François Bergeron
;
Riccardo Biagioli
Kernels of directed graph Laplacians
J. S. Caughman
;
J. J. P. Veerman
Discrepancy of symmetric products of hypergraphs
Benjamin Doerr
;
Michael Gnewuch
;
Nils Hebbinghaus
Equitable matroids
Dillon Mayhew
A new statistic on linear and circular \(r\)-mino arrangements
Mark A. Shattuck
;
Carl G. Wagner
Optimal four-dimensional codes over \(\text{GF}(8)\)
Chris Jones
;
Angela Matney
;
Harold Ward
Bounding the number of edges in permutation graphs
Peter Keevash
;
Po-Shen Loh
;
Benny Sudakov
Domino Fibonacci tableaux
Naiomi Cameron
;
Kendra Killpatrick
The polytope of degree partitions
Amitava Bhattacharya
;
S. Sivasubramanian
;
Murali K. Srinivasan
Latin squares with forbidden entries
Jonathan Cutler
;
Lars-Daniel Öhman
Tilings of the sphere with right triangles. I: The asymptotically right families
Robert J. MacG. Dawson
;
Blair Doyle
Tilings of the sphere with right triangles. II: The \((1,3,2)\), \((0,2,n)\) subfamily
Robert J. MacG. Dawson
;
Blair Doyle
\(3\)-designs from PGL\((2,q)\)
P. J. Cameron
;
G. R. Omidi
;
B. Tayfeh-Rezaie
Three-letter-pattern avoiding permutations and functional equations
Ghassan Firro
;
Toufik Mansour
Two finite forms of Watson's quintuple product identity and matrix inversion
X. Ma
The generating function of ternary trees and continued fractions
Ira M. Gessel
;
Guoce Xin
Grid classes and the Fibonacci dichotomy for restricted permutations
Sophie Huczynska
;
Vincent Vatter
On some Ramsey and Turán-type numbers for paths and cycles
Tomasz Dzido
;
Marek Kubale
;
Konrad Piwakowski
Jamming and geometric representations of graphs
Werner Krauth
;
Martin Loebl
Reduced canonical forms of stoppers
Aaron N. Siegel
The minimum size of complete caps in \(({\mathbb Z}/n{\mathbb Z})^2\)
Jack Huizenga
Total domination and matching numbers in claw-free graphs
Michael A. Henning
;
Anders Yeo
Relaxations of Ore's condition on cycles
Ahmed Ainouche
Colorings and orientations of matrices and graphs
Uwe Schauz
Generalized Cauchy identities, trees and multidimensional Brownian motions. I: Bijective proof of generalized Cauchy identities
Piotr Šniady
Counting rooted trees: the universal law \(t(n)\sim C\rho^{-n} n^{-3/2}\)
Jason P. Bell
;
Stanley N. Burris
;
Karen A. Yeats
Classifying descents according to equivalence \(\operatorname{mod} k\)
Sergey Kitaev
;
Jeffrey Remmel
The number of permutation binomials over \({\mathbb F}_{4p+1}\) where \(p\) and \(4p+1\) are primes
A. Masuda
;
D. Panario
;
Q. Wang
Permutation reconstruction from minors
Mariana Raykova
Hard squares with negative activity and rhombus tilings of the plane
Jakob Jonsson
Permutations generated by a stack of depth 2 and an infinite stack in series
Murray Elder
On arc-coloring of subcubic graphs
Alexandre Pinlou
The maximum distinguishing number of a group
Melody Chan
Factorial Grothendieck polynomials
Peter J. McNamara
Bounding the partition function of spin-systems
David J. Galvin
Drawing a graph in a hypercube
David R. Wood
Fractional biclique covers and partitions of graphs
Valerie L. Watts
Grothendieck bialgebras, partition lattices, and symmetric functions in noncommutative variables
N. Bergeron
;
C. Hohlweg
;
M. Rosas
;
M. Zabrocki
The valuations of the near octagon \({\mathbb I}_4\)
Bart De Bruyn
;
Pieter Vandecasteele
Neighbour-distinguishing edge colourings of random regular graphs
Catherine Greenhill
;
Andrzej Ruciński
Identifying graph automorphisms using determining sets
Debra L. Boutin
Cubic partial cubes from simplicial arrangements
David Eppstein
Shift-induced dynamical systems on partitions and compositions
Brian Hopkins
;
Michael A. Jones
Encores on cores
Julie Cain
;
Nicholas Wormald
Binary words containing infinitely many overlaps
James Currie
;
Narad Rampersad
;
Jeffrey Shallit
Identifying \(X\)-trees with few characters
Magnus Bordewich
;
Charles Semple
;
Mike Steel
The zeta function of a hypergraph
Christopher K. Storm
Asymptotics for incidence matrix classes
Peter Cameron
;
Thomas Prellberg
;
Dudley Stark
Double crystals of binary and integral matrices
Marc A. A. van Leeuwen
Plethysm for wreath products and homology of sub-posets of Dowling lattices
Anthony Henderson
New regular partial difference sets and strongly regular graphs with parameters \((96,20,4,4)\) and \((96,19,2,4)\)
Anka Golemac
;
Joško Mandić
;
Tanja Vučičić
Matchings avoiding partial patterns and lattice paths
Vít Jelínek
;
Nelson Y. Li
;
Toufik Mansour
;
Sherry H. F. Yan
Characterization of \([1,k]\)-bar visibility trees
Guantao Chen
;
Joan P. Hutchinson
;
Ken Keating
;
Jian Shen
Weighted zeta functions of graph coverings
Iwao Sato
Edge-magic group labellings of countable graphs
Nicholas Cavenagh
;
Diana Combe
;
Adrian M. Nelson
Restricted walks in regular trees
Laura Ciobanu
;
Saša Radomirović
Nilpotent Singer groups.
Nick Gill
Perfect matching preservers
Richard A. Brualdi
;
Martin Loebl
;
Ondřej Pangrác
Parity versions of 2-connectedness
C. Little
;
A. Vince
Total 4-choosability of series-parallel graphs
Douglas R. Woodall
Edge and total choosability of near-outerplanar graphs
Timothy J. Hetherington
;
Douglas R. Woodall
A quantitative ergodic theory proof of Szemerédi's theorem
Terence Tao
Shift equivalence of P-finite sequences
Manuel Kauers
From well-quasi-ordered sets to better-quasi-ordered sets
Maurice Pouzet
;
Norbert Sauer
On a balanced property of derangements
Miklós Bóna
A hybrid of Darboux's method and singularity analysis in combinatorial asymptotics
Philippe Flajolet
;
Eric Fusy
;
Xavier Gourdon
;
Daniel Panario
;
Nicolas Pouyanne
Movable \((n_4)\) configurations
Leah Wrenn Berman
On lengths of rainbow cycles
Boris Alexeev
Hayman admissible functions in several variables
Bernhard Gittenberger
;
Johannes Mandlburger
Cycle lengths in a permutation are typically Poisson
Andrew Granville
A combinatorial derivation of the PASEP stationary state
Richard Brak
;
Sylvie Corteel
;
John Essam
;
Robert Parviainen
;
Andrew Rechnitzer
Constructions of representations of rank two semisimple Lie algebras with distributive lattices
L. Wyatt Alverson II
;
Robert G. Donnelly
;
Scott J. Lewis
;
Robert Pervine
Proof of the Razumov-Stroganov conjecture for some infinite families of link patterns
P. Zinn-Justin
Permutations, cycles and the pattern 2--13
Robert Parviainen
Matchings avoiding partial patterns
William Y. C. Chen
;
Toufik Mansour
;
Sherry H. F. Yan
Bounded-degree graphs can have arbitrarily large slope numbers
János Pach
;
Dömötör Pálvölgyi
The non-crossing graph
Nathan Linial
;
Michael Saks
;
David Statter
A note on the number of Hamiltonian paths in strong tournaments
Arthur H. Busch
The diameter and Laplacian eigenvalues of directed graphs
Fan Chung
Chains, subwords, and fillings: strong equivalence of three definitions of the Bruhat order
Catalin Zara
Proof of an intersection theorem via graph homomorphisms
Irit Dinur
;
Ehud Friedgut
Dynamic single-pile Nim using multiple bases
Arthur Holshouser
;
Harold Reiter
On the number of possible row and column sums of \(0,1\)-matrices
Daniel Goldstein
;
Richard Stong
An addition theorem on the cyclic group \({\mathbb Z}_{p^\alpha q^\beta}\)
Hui-Qin Cao
A point in many triangles
Boris Bukh
Permutation reconstruction
Rebecca Smith
Noncrossing trees and noncrossing graphs
William Y. C. Chen
;
Sherry H. F. Yan
The absence of efficient dual pairs of spanning trees in planar graphs
T. R. Riley
;
W. P. Thurston
On an identity for the cycle indices of rooted tree automorphism groups
Stephan G. Wagner
An Ehrhart series formula for reflexive polytopes
Benjamin Braun
On the proof of a theorem of Pálfy.
Edward Dobson
The induced subgraph order on unlabelled graphs
Craig A. Sloss
BG-ranks and 2-cores
William Y. C. Chen
;
Kathy Q. Ji
;
Herbert S. Wilf
Parameter augmentation for two formulas
Caihuan Zhang
The circular chromatic index of flower snarks
Mohammad Ghebleh
;
Daniel Král'
;
Serguei Norine
;
Robin Thomas
On the symmetry of the distribution of \(k\)-crossings and \(k\)-nestings in graphs
Anna de Mier
A note on exponents vs root heights for complex simple Lie algebras
Sankaran Viswanath
A survey on packing and covering problems in the Hamming permutation space
Jörn Quistorff
A new table of constant weight codes of length greater than 28
D. H. Smith
;
L. A. Hughes
;
S. Perkins