Parcourir par
Collections
Sources
Geodesic
Parcourir par
Collections
Sources
The electronic journal of combinatorics
Tome 16 (2009)
no. 1
Précédent
Suivant
Tome 16 (2009) no. 1
Sommaire
On a class of hyperplanes of the symplectic and Hermitian dual polar spaces
Bart De Bruyn
Minimal percolating sets in bootstrap percolation
Robert Morris
\(k\)-cycle free one-factorizations of complete graphs
Mariusz Meszka
Lower bounds for the size of random maximal \(H\)-free graphs
Guy Wolfovitz
Consistent cycles in 1/2-arc-transitive graphs
Marko Boben
;
Štefko Miklavič
;
Primož Potočnik
A note on commuting graphs for symmetric groups
C. Bates
;
D. Bundy
;
S. Hart
;
P. Rowley
Repetition number of graphs
Yair Caro
;
Douglas B. West
The block connectivity of random trees
Andrew R. A. McGrae
;
Michele Zito
Ternary linear codes and quadrics
Yuri Yoshida
;
Tatsuya Maruta
On the locality of the Prüfer code
Craig Lennon
Balanced online Ramsey games in random graphs
Anupam Prakash
;
Reto Spöhel
;
Henning Thomas
Littlewood-Richardson coefficients and integrable tilings
Paul Zinn-Justin
Comultiplication rules for the double Schur functions and Cauchy identities
A. I. Molev
On the monochromatic Schur triples type problem
Thotsaporn "Aek" Thanatipanonda
The complexity of constructing gerechte designs
E. R. Vaughan
An alternative definition of the notion valuation in the theory of near polygons
Bart De Bruyn
Automorphism groups of wreath product digraphs
Edward Dobson
;
Joy Morris
Semiaffine spaces
Hendrik Van Maldeghem
Reconstructing permutations from cycle minors
Maria Monks
On a problem of Marco Buratti
Peter Horak
;
Alexander Rosa
A semigroup approach to wreath-product extensions of Solomon's descent algebras.
Samuel K. Hsiao
The \(\{4,5\}\) isogonal sponges on the cubic lattice
Steven B. Gillispie
;
Branko Grünbaum
Restricting supercharacters of the finite group of unipotent uppertriangular matrices.
Nathaniel Thiem
;
Vidya Venkateswaran
Generation of optimal packings from optimal packings
Thierry Gensane
Restrictions and generalizations on comma-free codes
Alexander L. Churchill
Reachability relations and the structure of transitive digraphs
Norbert Seifter
;
Vladimir I. Trofimov
Independence number of 2-factor-plus-triangles graphs
Jennifer Vandenbussche
;
Douglas B. West
On two problems regarding the Hamiltonian cycle game
Dan Hefetz
;
Sebastian Stich
On the first occurrence of strings
Robert W. Chen
;
Burton Rosenberg
Bartholdi zeta functions of fractal graphs
Iwao Sato
Coverings, Laplacians, and heat kernels of directed graphs
Clara E. Brasseur
;
Ryan E. Grady
;
Stratos Prassidis
Enumeration of derangements with descents in prescribed positions
Niklas Eriksen
;
Ragnar Freij
;
Johan Wästlund
Spectral saturation: inverting the spectral Turán theorem
Vladimir Nikiforov
The existence of FGDRP\((3,g^{u})\)'s
Jie Yan
;
Chengmin Wang
Clique-width and the speed of hereditary properties
Peter Allen
;
Vadim Lozin
;
Michaël Rao
Optimal Betti numbers of forest ideals
Michael Goff
Efficient counting and asymptotics of \(k\)-noncrossing tangled diagrams
William Y. C. Chen
;
Jing Qin
;
Christian M. Reidys
;
Doron Zeilberger
Discrete Morse inequalities on infinite graphs
Rafael Ayala
;
Luis M. Fernández
;
José A. Vilches
Fixing numbers of graphs and groups
Courtney R. Gibbons
;
Joshua D. Laison
Topological circles and Euler tours in locally finite graphs
Agelos Georgakopoulos
The alternating sign matrix polytope
Jessica Striker
Near threshold graphs
Steve Kirkland
A graph-theoretic method for choosing a spanning set for a finite-dimensional vector space, with applications to the Grossman-Larson-Wright module and the Jacobian conjecture
Dan Singer
Rate of convergence of the short cycle distribution in random regular graphs generated by pegging
Pu Gao
;
Nicholas Wormald
Crossings, colorings, and cliques
Michael O. Albertson
;
Daniel W. Cranston
;
Jacob Fox
Random even graphs
Geoffrey Grimmett
;
Svante Janson
On \(k\)-walk-regular graphs
C. Dalfó
;
M. A. Fiol
;
E. Garriga
Geometrically constructed bases for homology of non-crossing partition lattices
Aisling Kenny
The number of elements in the mutation class of a quiver of type \(D_n\).
Aslak Bakke Buan
;
Hermund André Torkildsen
Labeled factorization of integers
Augustine O. Munagi
A rainbow \(k\)-matching in the complete graph with \(r\) colors
Shinya Fujita
;
Atsushi Kaneko
;
Ingo Schiermeyer
;
Kazuhiro Suzuki
Pfaffian orientation and enumeration of perfect matchings for some Cartesian products of graphs
Feng-Gen Lin
;
Lian-Zhu Zhang
Semifields in class \(\mathcal F_{4}^{(a)}\)
Gary Ebert
;
Giuseppe Marino
;
Olga Polverino
;
Rocco Trombetti
The maximum of the maximum rectilinear crossing numbers of \(d\)-regular graphs of order \(n\)
Matthew Alpert
;
Elie Feder
;
Heiko Harborth
Scheduling partial round robin tournaments subject to home away pattern sets
Kenji Kashiwabara
On the total weight of weighted matchings of segment graphs
Thomas Stoll
;
Jiang Zeng
Products of all elements in a loop and a framework for non-associative analogues of the Hall-Paige conjecture.
Kyle Pula
Wilf-equivalence on \(k\)-ary words, compositions, and parking functions
Vít Jelínek
;
Toufik Mansour
Small maximal sum-free sets.
Michael Giudici
;
Sarah Hart
Counting nondecreasing integer sequences that Lie below a barrier
Robin Pemantle
;
Herbert S. Wilf
Multipartite separability of Laplacian matrices of graphs
Chai Wah Wu
Hook length formulas for trees by Han's expansion
William Y.C. Chen
;
Oliver X.Q. Gao
;
Peter L. Guo
Enumerating permutations that avoid three term arithmetic progressions
Arun Sharma
Evaluating a weighted graph polynomial for graphs of bounded tree-width
S. D. Noble
Graceful tree conjecture for infinite trees
Tsz Lung Chan
;
Wai Shun Cheung
;
Tuen Wai Ng
Maximum exponent of Boolean circulant matrices with constant number of nonzero entries in their generating vector
M. I. Bueno
;
S. Furtado
;
N. Sherer
Lattice paths, sampling without replacement, and limiting distributions
M. Kuba
;
A. Panholzer
;
H. Prodinger
Face vectors of two-dimensional Buchsbaum complexes
Satoshi Murai
Maximal flat antichains of minimum weight
Martin Grüttmüller
;
Sven Hartmann
;
Thomas Kalinowski
;
Uwe Leck
;
Ian T. Roberts
A normalization formula for the Jack polynomials in superspace and an identity on partitions
Luc Lapointe
;
Yvan Le Borgne
;
Philippe Nadeau
Chromatic number for a generalization of Cartesian product graphs
Daniel Král'
;
Douglas B. West
Counting abelian squares
L. B. Richmond
;
Jeffrey Shallit
A reformulation of matrix graph grammars with Boolean complexes
Pedro Pablo Pérez Velasco
;
Juan de Lara
Certificates of factorisation for chromatic polynomials
Kerri Morgan
;
Graham Farr
Certificates of factorisation for a class of triangle-free graphs
Kerri Morgan
;
Graham Farr
Distinguishing chromatic numbers of bipartite graphs
C. Laflamme
;
K. Seyffarth
Mr. Paint and Mrs. Correct
Uwe Schauz
A \(q\)-analogue of de Finetti's theorem
Alexander Gnedin
;
Grigori Olshanski
Combinatorial necklace splitting
Dömötör Pálvölgyi
The Laplacian spread of tricyclic graphs
Yanqing Chen
;
Ligong Wang
Maximum multiplicity of a root of the matching polynomial of a tree and minimum path cover
Cheng Yeaw Ku
;
K. B. Wong
Updown numbers and the initial monomials of the slope variety
Jeremy L. Martin
;
Jennifer D. Wagner
Some families of orthogonal polynomials of a discrete variable and their applications to graphs and codes
M. Cámara
;
J. Fàbrega
;
M. A. Fiol
;
E. Garriga
Properties determined by the Ihara zeta function of a graph
Yaim Cooper
Anti-Ramsey numbers for graphs with independent cycles
Zemin Jin
;
Xueliang Li
Squishing dimers on the hexagon lattice
Ben Young
Spherical f-tilings by scalene triangles and isosceles trapezoids. III
Catarina P. Avelino
;
Altino F. Santos
Bounds on the distinguishing chromatic number
Karen L. Collins
;
Mark Hovey
;
Ann N. Trenk
A dual of the rectangle-segmentation problem for binary matrices
Thomas Kalinowski
An edge-minimization problem for regular polygons
Ralph H. Buchholz
;
Warwick de Launey
Saturation numbers for trees
Jill Faudree
;
Ralph J. Faudree
;
Ronald J. Gould
;
Michael S. Jacobson
Defective choosability of graphs without small minors
Rupert G. Wood
;
Douglas R. Woodall
Almost all trees have an even number of independent sets
Stephan G. Wagner
Some results on chromatic polynomials of hypergraphs
Manfred Walter
Hurwitz equivalence in tuples of dihedral groups, dicyclic groups, and semidihedral groups.
Charmaine Sia
Locally primitive normal Cayley graphs of metacyclic groups
Jiangmin Pan
Subsequence sums of zero-sum-free sequences
Pingzhi Yuan
Positivity in coefficient-free rank two cluster algebras.
G. Dupont
Profiles of permutations
Michael Lugo
The inverse Erdős-Heilbronn problem
Van H. Vu
;
Philip Matchett Wood
Permutation statistics and \(q\)-Fibonacci numbers
Adam M. Goyt
;
David Mathisen
Tight bounds for quasirandom rumor spreading
Spyros Angelopoulos
;
Benjamin Doerr
;
Anna Huber
;
Konstantinos Panagiotou
Noncommutative determinants, Cauchy-Binet formulae, and Capelli-type identities. I: Generalizations of the Capelli and Turnbull identities
Sergio Caracciolo
;
Alan D. Sokal
;
Andrea Sportiello
Generating functions for the number of permutations with limited displacement
Torleiv Kløve
Generalized Schur numbers for \(x_1+ x_2+ c= 3x_3\)
André E. Kézdy
;
Hunter S. Snevily
;
Susan C. White
On biembeddings of Latin squares
M. J. Grannell
;
T. S. Griggs
;
M. Knor
Degree powers in graphs with a forbidden even cycle
Vladimir Nikiforov
Locally restricted compositions. II: General restrictions and infinite matrices
Edward A. Bender
;
E. Rodney Canfield
Tiling tripartite graphs with 3-colorable graphs
Ryan Martin
;
Yi Zhao
Composition of transpositions and equality of ribbon Schur \(Q\)-functions
Farzin Barekat
;
Stephanie van Willigenburg
\(q\)-counting descent pairs with prescribed tops and bottoms
John Hall
;
Jeffrey Liese
;
Jeffrey B. Remmel
Combinatorics of tripartite boundary connections for trees and dimers
Richard W. Kenyon
;
David B. Wilson
A new lower bound on the density of vertex identifying codes for the infinite hexagonal grid
Daniel W. Cranston
;
Gexin Yu
Another product construction for large sets of resolvable directed triple systems
Hongtao Zhao
Vertex-oriented Hamilton cycles in directed graphs
Michael J. Plantholt
;
Shailesh K. Tipnis
On suborbital graphs for the normalizer of \(\Gamma _{0}(N)\)
Refik Keskin
;
Bahar Demirtürk
On the unitary Cayley graph of a finite ring
Reza Akhtar
;
Megan Boggess
;
Tiffany Jackson-Henderson
;
Isidora Jiménez
;
Rachel Karpman
;
Amanda Kinzel
;
Dan Pritikin
Tetravalent non-normal Cayley graphs of order \(4p\)
Jin-Xin Zhou
Rainbow matchings in \(r\)-partite \(r\)-graphs
Ron Aharoni
;
Eli Berger
Non-isomorphic graphs with cospectral symmetric powers
Amir Rahnamai Barghi
;
Ilya Ponomarenko
An elementary chromatic reduction for gain graphs and special hyperplane arrangements
Pascal Berthomé
;
Raul Cordovil
;
David Forge
;
Véronique Ventos
;
Thomas Zaslavsky
Which Cayley graphs are integral?
A. Abdollahi
;
E. Vatandoost
Spectral extrema for graphs: the Zarankiewicz problem
László Babai
;
Barry Guiduli
The excessive [3]-index of all graphs
David Cariolaro
;
Hung-Lin Fu
Perfect matchings for the three-term Gale-Robinson sequences
Mireille Bousquet-Mélou
;
James Propp
;
Julian West
Counting fixed-height tatami tilings
Frank Ruskey
;
Jennifer Woodcock
On-line list colouring of graphs
Xuding Zhu
Symmetric functions for the generating matrix of the Yangian of \(\mathfrak{gl}_{n}(\mathbb C)\)
Natasha Rozhkovskaya
Trees and meta-Fibonacci sequences
Abraham Isgur
;
David Reiss
;
Stephen Tanny
Random threshold graphs
Elizabeth Perez Reilly
;
Edward R. Scheinerman
Entrywise bounds for eigenvectors of random graphs
Pradipta Mitra
A new determinant expression of the zeta function for a hypergraph
Iwao Sato
Lower bounds for \(q\)-ary codes with large covering radius
Wolfgang Haas
;
Immanuel Halupczok
;
Jan-Christoph Schlage-Puchta
Bounds for the Hückel energy of a graph
Ebrahim Ghorbani
;
Jack H. Koolen
;
Jae Young Yang
Some gregarious cycle decompositions of complete equipartite graphs
Benjamin R. Smith
Counting 1324, 4231-avoiding permutations
Michael H. Albert
;
M. D. Atkinson
;
Vincent Vatter
The valuations of the near polygon G\(_{n}\)
Bart De Bruyn
The spectral gap of random graphs with given expected degrees
Amin Coja-Oghlan
;
André Lanka
Mixing time for a random walk on rooted trees
Jason Fulman
Positivity of the \(T\)-system cluster algebra
Philippe Di Francesco
;
Rinat Kedem
Isosceles sets
Yury J. Ionin
Set families with a forbidden subposet
Boris Bukh
Euler characteristic of the truncated order complex of generalized noncrossing partitions
D. Armstrong
;
C. Krattenthaler
Geodetic topological cycles in locally finite graphs
Agelos Georgakopoulos
;
Philipp Sprüssel
Application of graph combinatorics to rational identities of type \(A\)
Adrien Boussicault
;
Valentin Féray
Gelfand-Graev characters of the finite unitary groups.
Nathaniel Thiem
;
C. Ryan Vinroot
Multi-covering radius for rank metric codes
W. B. Vasantha
;
R. S. Selvaraj
On \(\mathrm{STD}_6[18,3]\)'s and \(\mathrm{STD}_7[21,3]\)'s admitting a semiregular automorphism group of order 9
Kenzi Akiyama
;
Masayuki Ogawa
;
Chihiro Suetake
Automorphism groups of Cayley digraphs of \(\mathbb Z_{p}^{3}\)
Edward Dobson
;
István Kovács
An improvement to Mathon's cyclotomic Ramsey colorings
Xiaodong Xu
;
Stanisław P. Radziszowski
Landau's and Rado's theorems and partial tournaments
Richard A. Brualdi
;
Kathleen Kiernan
On the size of minimal unsatisfiable formulas
Choongbum Lee
On some partitions related to \(\mathbb Q(\sqrt 2)\)
Alexander E. Patkowski
A short proof, based on mixed volumes, of Liggett's theorem on the convolution of ultra-logconcave sequences
Leonid Gurvits
Stability of graphs
Bünyamin Demir
;
Ali Deniz
;
Şahin Koçak
Alternating, pattern-avoiding permutations
Joel Brewster Lewis
Traces of uniform families of sets
Balázs Patkós
A duality based proof of the combinatorial nullstellensatz
Omran Kouba
A note on divisibility of the number of matchings of a family of graphs
Kyung-Won Hwang
;
Naeem N. Sheikh
;
Stephen G. Hartke
Multigraphs (only) satisfy a weak triangle removal lemma
Asaf Shapira
;
Raphael Yuster
On coloring the odd-distance graph
Jacob Steinhardt
The maximum size of a partial spread in \(H(4n+1, q^{2})\) is \(q^{2n+1}+1\)
Frédéric Vanhove
Perfectly balanced partitions of smoothed graphs
Ido Ben-Eliezer
;
Michael Krivelevich
Non-repetitive 3-coloring of subdivided graphs
Andrzej Pezarski
;
Michał Zmarz
Note on generating all subsets of a finite set with disjoint unions
David Ellis
Set systems with restricted \(t\)-wise intersections modulo prime powers
Rudy X. J. Liu
A note on embedding hypertrees
Po-Shen Loh
A note on edge-colourings avoiding rainbow \(K_{4}\) and monochromatic \(K_{m}\)
Veselin Jungić
;
Tomáš Kaiser
;
Daniel Král'
Cospectral graphs on 12 vertices
A. E. Brouwer
;
E. Spence
Higher chain formula proved by combinatorics
Tsoy-Wo Ma
A stability property for coefficients in Kronecker products of complex \(S_{n}\) characters
Ernesto Vallejo
Paths and stability number in digraphs
Jacob Fox
;
Benny Sudakov
On the energy of unitary Cayley graphs
H. N. Ramaswamy
;
C. R. Veena
Sudoku graphs are integral
Torsten Sander
Maximum independent sets in certain powers of odd cycles
Tom Bohman
;
Ron Holzman
;
Venkatesh Natarajan
Depth reduction of a class of Witten zeta functions
Xia Zhou
;
David M. Bradley
;
Tianxin Cai
A note on \(K^-_{\Delta +1}\)-free precolouring with \(\Delta\) colours
Tom Rackham
Cayley graphs on the symmetric group generated by initial reversals have unit spectral gap
Filippo Cesi
A note on packing graphs without cycles of length up to five
Agnieszka Görlich
;
Andrzej Żak
Unit distance graphs with ambiguous chromatic number
Michael S. Payne
Skew spectra of oriented graphs
Bryan Shader
;
Wasin So
A note on the distance-balanced property of generalized Petersen graphs
Rui Yang
;
Xinmin Hou
;
Ning Li
;
Wei Zhong
Bipartite coverings and the chromatic number
Dhruv Mubayi
;
Sundar Vishwanathan