Parcourir par
Collections
Sources
Geodesic
Parcourir par
Collections
Sources
The electronic journal of combinatorics
Tome 17 (2010)
Précédent
Suivant
Tome 17 (2010)
Sommaire
Asymptotics of some convolutional recurrences
Edward A. Bender
;
Adri B. Olde Daalhuis
;
Zhicheng Gao
;
L. Bruce Richmond
;
Nicholas Wormald
Constructing 5-configurations with chiral symmetry
Leah Wrenn Berman
;
Laura Ng
Lindelöf representations and (non-)holonomic sequences
Philippe Flajolet
;
Stefan Gerhold
;
Bruno Salvy
On universal cycles of labeled graphs
Greg Brockman
;
Bill Kay
;
Emma E. Snively
Potential-based strategies for tic-tac-toe on the integer lattice with numerous directions
Klay Kruczek
;
Eric Sundberg
Large bounded degree trees in expanding graphs
József Balogh
;
Béla Csaba
;
Martin Pei
;
Wojciech Samotij
The evolution of uniform random planar graphs
Chris Dowden
Gorenstein polytopes obtained from bipartite graphs
Makoto Tagami
A combinatorial proof of a formula for Betti numbers of a stacked polytope
Suyoung Choi
;
Jang Soo Kim
The Abel-type polynomial identities
Fengying Huang
;
Bolian Liu
Game colouring directed graphs
Daqing Yang
;
Xuding Zhu
The planarity theorems of MacLane and Whitney for graph-like continua
Robin Christian
;
R. Bruce Richter
;
Brendan Rooney
Flexible color lists in Alon and Tarsi's theorem, and time scheduling with unreliable participants
Uwe Schauz
Permutations with ascending and descending blocks
Jacob Steinhardt
Pattern hypergraphs
Zdeněk Dvořák
;
Jan Kára
;
Daniel Král'
;
Ondřej Pangrác
Congruences involving alternating multiple harmonic sums
Roberto Tauraso
Graph powers and graph homomorphisms
Hossein Hajiabolhassan
;
Ali Taherkhani
Some design theoretic results on the Conway group .0
Ben Fairbairn
Counting subwords in a partition of a set
Toufik Mansour
;
Mark Shattuck
;
Sherry H.F. Yan
Distinguishing number of countable homogeneous relational structures
C. Laflamme
;
L. Nguyen Van Thé
;
N. Sauer
Dense \(H\)-free graphs are almost \((\chi (H)-1)\)-partite
Peter Allen
Minimally intersecting set partitions of type B
William Y.C. Chen
;
David G.L. Wang
Degree distributions in general random intersection graphs
Yilun Shang
Promotion operator on rigged configurations of type \(A\)
Anne Schilling
;
Qiang Wang
Bootstrap percolation and diffusion in random graphs with given vertex degrees
Hamed Amini
On randomly generated non-trivially intersecting hypergraphs
Balázs Patkós
Generating functions for permutations which contain a given descent set
Jeffrey Remmel
;
Manda Riehl
The toric ideal of a matroid of rank 3 is generated by quadrics
Kenji Kashiwabara
Enumeration schemes for permutations avoiding barred patterns
Lara Pudwell
Extremal graph theory for metric dimension and diameter
Carmen Hernando
;
Mercè Mora
;
Ignacio M. Pelayo
;
Carlos Seara
;
David R. Wood
On colorings avoiding a rainbow cycle and a fixed monochromatic subgraph
Maria Axenovich
;
JiHyeok Choi
Factorisation of snarks
Miroslav Chladný
;
Martin Škoviera
Combinatorial constructions of weight bases: the Gelfand-Tsetlin basis
Patricia Hersh
;
Cristian Lenart
MacMahon's theorem for a set of permutations with given descent indices and right-maximal records
A. Dzhumadil'daev
\(B_h\) sequences in higher dimensions
Laurence Rackham
;
Paulius Šarka
Enumeration of perfect matchings of a type of quadratic lattice on the torus
Fuliang Lu
;
Lianzhu Zhang
;
Fenggen Lin
Combinatorial vs. algebraic characterizations of completely pseudo-regular codes
M. Cámara
;
J. Fàbrega
;
M. A. Fiol
;
E. Garriga
On a Rado type problem for homogeneous second order linear recurrences
Hayri Ardal
;
Zdeněk Dvořák
;
Veselin Jungić
;
Tomáš Kaiser
Satisfying states of triangulations of a convex \(n\)-gon
A. Jiménez
;
M. Kiwi
;
M. Loebl
\(H\)-decompositions of \(r\)-graphs when \(H\) is an \(r\)-graph with exactly 2 edges
Teresa Sousa
Congruence classes of orientable 2-cell embeddings of bouquets of circles and dipoles
Yan-Quan Feng
;
Jin-Ho Kwak
;
Jin-Xin Zhou
Spectral characterizations of dumbbell graphs
Jianfeng Wang
;
Francesco Belardo
;
Qiongxiang Huang
;
Enzo M. Li Marzi
Plancherel averages: remarks on a paper by Stanley
Grigori Olshanski
Hamiltonian paths in the complete graph with edge-lengths 1, 2, 3
Stefano Capparelli
;
Alberto Del Fra
The minimal perimeter for \(N\) confined deformable bubbles of equal area
S. J. Cox
;
E. Flikkema
Value-peaks of permutations
Pierre Bouchard
;
Hungyung Chang
;
Jun Ma
;
Jean Yeh
;
Yeong-Nan Yeh
The cyclic sieving phenomenon for faces of cyclic polytopes
Sen-Peng Eu
;
Tung-Shan Fu
;
Yeh-Jong Pan
Aperiodic non-isomorphic lattices with equivalent percolation and random-cluster models
Klas Markström
;
John C. Wierman
Positively curved combinatorial 3-manifolds
Aaron Trout
Forbidden configurations: exact bounds determined by critical substructures
R. P. Anstee
;
S. N. Karp
Enumeration of alternating sign matrices of even size (quasi-)Invariant under a quarter-turn rotation
Jean-Christophe Aval
;
Philippe Duchon
Ehrhart clutters: regularity and max-flow min-cut
José Martínez-Bernal
;
Edwin O'Shea
;
Rafael H. Villarreal
Ascent sequences and upper triangular matrices containing non-negative integers
Mark Dukes
;
Robert Parviainen
Encodings of cladograms and labeled trees
Daniel J. Ford
Orthogonal vector coloring
Gerald Haynes
;
Catherine Park
;
Amanda Schaeffer
;
Jordan Webster
;
Lon H. Mitchell
On winning fast in Avoider-Enforcer games
János Barát
;
Miloš Stojaković
Positivity of three-term recurrence sequences
Lily L. Liu
Some inequalities in functional analysis, combinatorics, and probability theory
Chunrong Feng
;
Liangpan Li
;
Jian Shen
The \(t\)-stability number of a random graph
Nikolaos Fountoulakis
;
Ross J. Kang
;
Colin McDiarmid
On cross-intersecting uniform sub-families of hereditary families
Peter Borg
On convexity of polynomial paths and generalized majorizations
Marija Dodig
;
Marko Stošić
Consecutive patterns: from permutations to column-convex polyominoes and back
Don Rawlings
;
Mark Tiefenbruck
On the determining number and the metric dimension of graphs
José Cáceres
;
Delia Garijo
;
María Luz Puertas
;
Carlos Seara
A bijective proof of a major index theorem of Garsia and Gessel
Mordechai Novick
Polyiamonds and polyhexes with minimum site-perimeter and achievement games
Gábor Fülep
;
Nándor Sieben
A simple Havel-Hakimi type algorithm to realize graphical degree sequences of directed graphs
Péter L. Erdős
;
István Miklós
;
Zoltán Toroczkai
Cyclic sieving for longest reduced words in the hyperoctahedral group
T. Kyle Petersen
;
Luis Serrano
A finite calculus approach to Ehrhart polynomials
Steven V. Sam
;
Kevin M. Woods
On restricted unitary Cayley graphs and symplectic transformations modulo \(n\)
Niel de Beaudrap
Combinatorial interpretations of the Jacobi-Stirling numbers
Yoann Gelineau
;
Jiang Zeng
A Hilton-Milner theorem for vector spaces
A. Blokhuis
;
A. E. Brouwer
;
A. Chowdhury
;
P. Frankl
;
T. Mussche
;
B. Patkós
;
T. Szőnyi
The centers of gravity of the associahedron and of the permutahedron are the same
Christophe Hohlweg
;
Jonathan Lortie
;
Annie Raymond
Towards the Albertson conjecture
János Barát
;
Géza Tóth
The spectra of certain classes of room frames: the last cases
Jeffrey H. Dinitz
;
Gregory S. Warrington
Equidimensionality of the Brauer loop scheme
Brian Rothbach
Modular, \(k\)-noncrossing diagrams
Christian M. Reidys
;
Rita R. Wang
;
Albus Y. Y. Zhao
Sharply transitive 1-factorizations of complete multipartite graphs
Giuseppe Mazzuoccolo
;
Gloria Rinaldi
A conjecture of Biggs concerning the resistance of a distance-regular graph
Greg Markowsky
;
Jacobus Koolen
On the possible orders of a basis for a finite cyclic group
Peter Dukes
;
Peter Hegarty
;
Sarada Herke
Largest minimal percolating sets in hypercubes under 2-bootstrap percolation
Eric Riedl
Integral Cayley graphs over Abelian groups
Walter Klotz
;
Torsten Sander
An infinite family of graphs with the same Ihara zeta function
Christopher Storm
Graphical condensation, overlapping Pfaffians and superpositions of matchings
Markus Fulmek
Winning positions in simplicial Nim
David Horrocks
Discrete bidding games
Mike Develin
;
Sam Payne
Yet another hat game
Maura B. Paterson
;
Douglas R. Stinson
Double-critical graphs and complete minors
Ken-ichi Kawarabayashi
;
Anders Sune Pedersen
;
Bjarne Toft
Quantized dual graded graphs
Thomas Lam
The solution of the A\(_{r}\) T-system for arbitrary boundary
Philippe Di Francesco
Sortable elements for quivers with cycles.
Nathan Reading
;
David E Speyer
An optimal strongly identifying code in the infinite triangular grid
Iiro Honkala
How frequently is a system of 2-linear Boolean equations solvable?
Boris Pittel
;
Ji-A Yeum
A combinatorial formula for the Hilbert series of bigraded \(S_{n}\)-modules
Meesue Yoo
Zeros of the Jones polynomial are dense in the complex plane
Xian'an Jin
;
Fuji Zhang
;
Fengming Dong
;
Eng Guan Tay
Formal calculus and umbral calculus
Thomas J. Robinson
On the sharpness of some results relating cuts and crossing numbers
Laurent Beaudou
;
Drago Bokal
The ladder crystal
Chris Berg
Properties of the Steiner triple systems of order 19
Charles J. Colbourn
;
Anthony D. Forbes
;
Mike J. Grannell
;
Terry S. Griggs
;
Petteri Kaski
;
Patric R. J. Östergård
;
David A. Pike
;
Olli Pottonen
Maxmaxflow and counting subgraphs
Bill Jackson
;
Alan D. Sokal
On some densities in the set of permutations
Eugenijus Manstavičius
Symmetric bowtie decompositions of the complete graph
Simona Bonvicini
;
Beatrice Ruini
Random procedures for dominating sets in graphs
Sarah Artmann
;
Frank Göring
;
Jochen Harant
;
Dieter Rautenbach
;
Ingo Schiermeyer
Periodicity and other structure in a colorful family of Nim-like arrays
Lowell Abrams
;
Dena S. Cowen-Morton
On zero-sum free subsets of length 7
Pingzhi Yuan
;
Xiangneng Zeng
Aztec diamonds and Baxter permutations
Hal Canary
The asymptotic behavior of the average \(L^p\)-discrepancies and a randomized discrepancy
Stefan Steinerberger
A conjectured formula for fully packed loop configurations in a triangle
Paul Zinn-Justin
Logconcave random graphs
Alan Frieze
;
Santosh Vempala
;
Juan Vera
Records in set partitions
Arnold Knopfmacher
;
Toufik Mansour
;
Stephan Wagner
The largest component in an inhomogeneous random intersection graph with clustering
Mindaugas Bloznelis
An extremal theorem in the hypercube
David Conlon
Arcs with large conical subsets
K. Coolsaet
;
H. Sticker
Standard character condition for table algebras
Amir Rahnamai Barghi
;
Javad Bagherian
Recognizing graph theoretic properties with polynomial ideals
Jesús A. De Loera
;
Christopher J. Hillar
;
Peter N. Malkin
;
Mohamed Omar
On sum of powers of the Laplacian and signless Laplacian eigenvalues of graphs
Saieed Akbari
;
Ebrahim Ghorbani
;
Jacobus H. Koolen
;
Mohammad Reza Oboudi
Two simple proofs of Winquist's identity
Chutchai Nupet
;
Sarachai Kongsiriwong
Cyclic permutations of sequences and uniform partitions
Po-Yi Huang
;
Jun Ma
;
Yeong-Nan Yeh
Cyclic partitions of complete uniform hypergraphs
Artur Szymański
;
A. Paweł Wojda
Crystal rules for \((\ell,0)\)-JM partitions
Chris Berg
Crossings and nestings in set partitions of classical types
Martin Rubey
;
Christian Stump
Characteristic points of recursive systems
Jason P. Bell
;
Stanley N. Burris
;
Karen A. Yeats
Lower bounds for identifying codes in some infinite grids
Ryan Martin
;
Brendon Stanton
Intersections of nonclassical unitals and conics in \(\mathrm{PG}(2,q^2)\)
Angela Aguglia
;
Vincenzo Giordano
Riemann-Roch for sub-lattices of the root lattice \(A_n\)
Omid Amini
;
Madhusudan Manjunath
On the Koolen-Park inequality and Terwilliger graphs
Alexander L. Gavrilyuk
Optimal packings of 13 and 46 unit squares in a square
Wolfram Bentz
Enumerating pattern avoidance for affine permutations
Andrew Crites
On the structure of sets with few three-term arithmetic progressions
Ernie Croot
List coloring hypergraphs
Penny Haxell
;
Jacques Verstraete
Decomposing complete equipartite graphs into short odd cycles
Benjamin R. Smith
;
Nicholas J. Cavenagh
Enumeration of restricted permutation triples
Xiaojing Chen
;
Wenchang Chu
Sharp lower bound for the total number of matchings of tricyclic graphs
Shuchao Li
;
Zhongxun Zhu
Coloring the edges of a random graph without a monochromatic giant component
Reto Spöhel
;
Angelika Steger
;
Henning Thomas
Automorphism groups of a graph and a vertex-deleted subgraph
Stephen G. Hartke
;
Hannah Kolb
;
Jared Nishikawa
;
Derrick Stolee
New upper bounds for the size of permutation codes via linear programming
Mathieu Bogaerts
Densities of minor-closed graph families
David Eppstein
On the distribution of depths in increasing trees
Markus Kuba
;
Stephan Wagner
Factoring in embedding dimension three numerical semigroups
F. Aguiló-Gost
;
P. A. García-Sánchez
From a 1-rotational RBIBD to a partitioned difference family
Marco Buratti
;
Jie Yan
;
Chengmin Wang
On ternary square-free circular words
Arseny M. Shur
Growth rates for subclasses of Av(321)
M. H. Albert
;
M. D. Atkinson
;
R. Brignall
;
N. Ruškuc
;
Rebecca Smith
;
J. West
On the most weight \(w\) vectors in a dimension \(k\) binary code
Joshua Brown Kramer
On graphs with cyclic defect or excess
Charles Delorme
;
Guillermo Pineda-Villavicencio
On tours that contain all edges of a hypergraph
Zbigniew Lonc
;
Paweł Naroski
Locally restricted compositions. III: Adjacent-part periodic inequalities
Edward A. Bender
;
E. Rodney Canfield
Large convexly independent subsets of Minkowski sums
Konrad J. Swanepoel
;
Pavel Valtr
An interesting new Mahonian permutation statistic
Mark C. Wilson
Infinitely many hypermaps of a given type and genus
Gareth A. Jones
;
Daniel Pinto
The nonexistence of regular near octagons with parameters \((s,t,t_2,t_3)=(2,24,0,8)\)
Bart De Bruyn
Lower bounds for the average genus of a CF-graph
Yichao Chen
Graph minors and minimum degree
Gašper Fijavž
;
David R. Wood
Rotor-router aggregation on the layered square lattice
Wouter Kager
;
Lionel Levine
A Hessenberg generalization of the Garsia-Procesi basis for the cohomology ring of Springer varieties
Aba Mbirika
Symmetric Laman theorems for the groups \(\mathcal C_2\) and \(\mathcal C_s\)
Bernd Schulze
A formula for the bivariate map asymptotics constants in terms of the univariate map asymptotics constants
Zhicheng Gao
Climbing elements in finite Coxeter groups.
Thomas Brady
;
Aisling Kenny
;
Colum Watt
The diameter of almost Eulerian digraphs
Peter Dankelmann
;
L. Volkmann
Matchings and partial patterns
Vít Jelínek
;
Toufik Mansour
Regular factors of regular graphs from eigenvalues
Hongliang Lu
The enumeration of sequences with restrictions on their partial sums
Stephen Suen
;
Kevin P. Wagner
Building graphs from colored trees
Rachel M. Esselstein
;
Peter Winkler
The orderings of bicyclic graphs and connected graphs by algebraic connectivity
Jianxi Li
;
Ji-Ming Guo
;
Wai Chee Shiu
Cyclic derangements
Sami H. Assaf
A theory of transformation monoids: combinatorics and representation theory
Benjamin Steinberg
Thin Lehman matrices and their graphs
Jonathan Wang
Invariant and coinvariant spaces for the algebra of symmetric polynomials in non-commuting variables
François Bergeron
;
Aaron Lauve
The cover time of deterministic random walks
Tobias Friedrich
;
Thomas Sauerwald
A probabilistic approach to the asymptotics of the length of the longest alternating subsequence
Christian Houdré
;
Ricardo Restrepo
\(\lambda \)-factorials of \(n\)
Yidong Sun
;
Jujuan Zhuang
An extremal property of Turán graphs
Felix Lazebnik
;
Spencer Tofts
Classification of generalized Hadamard matrices \(H(6,3)\) and quaternary Hermitian self-dual codes of length 18
Masaaki Harada
;
Clement Lam
;
Akihiro Munemasa
;
Vladimir D. Tonchev
Honeycomb arrays
Simon R. Blackburn
;
Anastasia Panoui
;
Maura B. Paterson
;
Douglas R. Stinson
New results about set colorings of graphs
J. P. Boutin
;
E. Duchêne
;
B. Effantin
;
H. Kheddouci
;
H. Seba
On the linearity of higher-dimensional blocking sets
G. Van de Voorde
On the uniform generation of modular diagrams
Fenix W.D. Huang
;
Christian M. Reidys
A paintability version of the combinatorial Nullstellensatz, and list colorings of \(k\)-partite \(k\)-uniform hypergraphs
Uwe Schauz
Linear programming and the worst-case analysis of greedy algorithms on cubic graphs
W. Duckworth
;
N. Wormald
Mutually disjoint Steiner systems \(S\)(5, 8, 24) and 5-(24,12,48) designs
Makoto Araya
;
Masaaki Harada
A colorful involution for the generating function for signed Stirling numbers of the first kind
Paul Levande
On the \(h\)-vector of a lattice path matroid
Jay Schweig
Rank three residually connected geometries for \(M_{22}\), revisited
Dimitri Leemans
;
Peter Rowley
A note on the first occurrence of strings
Ying-Chao Hung
;
Robert W. Chen
;
Alan Zame
;
May-Ru Chen
Dissimilarity vectors of trees are contained in the tropical Grassmannian
Benjamin Iriarte Giraldo
Some symmetric identities involving a sequence of polynomials
Yuan He
;
Wenpeng Zhang
On multiplicative magic squares
Javier Cilleruelo
;
Florian Luca
Words with intervening neighbours in infinite Coxeter groups are reduced.
Henrik Eriksson
;
Kimmo Eriksson
A note on circuit graphs
Qing Cui
Another abstraction of the Erdős-Szekeres happy end theorem
Noga Alon
;
Ehsan Chiniforooshan
;
Vašek Chvátal
;
François Genest
Classification of \((p,q,n)\)-dipoles on nonorientable surfaces
Yan Yang
;
Yanpei Liu
Combinatorial proof of a curious \(q\)-binomial coefficient identity
Victor J. W. Guo
;
Jiang Zeng
Proof of the combinatorial nullstellensatz over integral domains, in the spirit of Kouba
Peter Heinig
Another characterisation of planar graphs
C. H. C. Little
;
G. Sanjith
Traces without maximal chains
Ta Sheng Tan
A note on packing chromatic number of the square lattice
Roman Soukal
;
Přemysl Holub
On the number of independent sets in a tree
Hiu-Fai Law
Colored trees and noncommutative symmetric functions
Matt Szczesny
A simple bijection between binary trees and colored ternary trees
Yidong Sun
A \(q\)-analogue of Graham, Hoffman and Hosoya's theorem
Sivaramakrishnan Sivasubramanian
A recurrence relation for the ``inv'' analogue of \(q\)-Eulerian polynomials
Chak-On Chow
Random subnetworks of random sorting networks
Omer Angel
;
Alexander E. Holroyd
Elementary proofs for convolution identities of Abel and Hagen-Rothe
Wenchang Chu
A generalization of generalized Paley graphs and new lower bounds for \(R(3,q)\)
Kang Wu
;
Wenlong Su
;
Haipeng Luo
;
Xiaodong Xu
Rainbow matching in edge-colored graphs
Timothy D. LeSaulnier
;
Christopher Stocker
;
Paul S. Wenger
;
Douglas B. West
Bijection between bigrassmannian permutations maximal below a permutation and its essential set
Masato Kobayashi
Loose Hamilton cycles in random 3-uniform hypergraphs
Alan Frieze
A classification of Ramanujan unitary Cayley graphs
Andrew Droll
A new approach to the Dyson coefficients
Sabrina X.M. Pang
;
Lun Lv
On Stanley's partition function
William Y. C. Chen
;
Kathy Q. Ji
;
Albert J. W. Zhu
A generalization of combinatorial Nullstellensatz
Michał Lasoń
Asymptotically optimal pairing strategy for tic-tac-toe with numerous directions
Padmini Mukkamala
;
Dömötör Pálvölgyi
Upper and lower bounds for \(F_v(4,4;5)\)
Xiaodong Xu
;
Haipeng Luo
;
Zehui Shao
A tight lower bound for convexly independent subsets of the Minkowski sums of planar point sets
Ondřej Bílka
;
Kevin Buchin
;
Radoslav Fulek
;
Masashi Kiyomi
;
Yoshio Okamoto
;
Shin-ichi Tanigawa
;
Csaba D. Tóth
The edge-count criterion for graphic lists
Garth Isaak
;
Douglas B. West
Ratio monotonicity of polynomials derived from nondecreasing sequences
William Y. C. Chen
;
Arthur L. B. Yang
;
Elaine L. F. Zhou
The many formulae for the number of Latin rectangles
Douglas S. Stones