Parcourir par
Collections
Sources
Geodesic
Parcourir par
Collections
Sources
The electronic journal of combinatorics
Tome 19 (2012)
Précédent
Suivant
Sommaire du
Fascicule no. 1
Finite factors of Bernoulli schemes and distinguishing labelings of directed graphs
Andrew Lazowski
;
Stephen M. Shea
On Euclidean designs and potential energy
Tsuyoshi Miezaki
;
Makoto Tagami
On harmonious colouring of trees
A. Aflaki
;
S. Akbari
;
K.J. Edwards
;
D.S. Eskandani
;
M. Jamaali
;
H. Ravanbod
On the upper tail of counts of strictly balanced subgraphs
Matas Šileikis
Local-to-global principles for the hitting sequence of a rotor walk
Giuliano Pezzolo Giacaglia
;
Lionel Levine
;
James Propp
;
Linda Zayas-Palmer
A basis of finite and infinite sets with small representation function
Artūras Dubickas
Descents of permutations in a Ferrers board
Chunwei Song
;
Catherine Yan
An improved inequality related to Vizing's conjecture
Stephen Suen
;
Jennifer Tarr
The \({1/k}\)-Eulerian polynomials
Carla D. Savage
;
Gopal Viswanathan
Anti-codes in terms of Berlekamp's switching game
Uwe Schauz
Partitions, Kostka polynomials and pairs of trees
Eliana Zoque
Kaleidoscopical configurations in \(G\)-spaces
Taras Banakh
;
Oleksandr Petrenko
;
Igor Protasov
;
Sergiy Slobodianiuk
Flag \(f\)-vectors of three-colored complexes
Andrew Frohmader
\(h\)-vectors of small matroid complexes
Jesús A. De Loera
;
Yvonne Kemper
;
Steven Klee
Domination reliability
Klaus Dohmen
;
Peter Tittmann
Maximal fillings of Moon polyominoes, simplicial complexes, and Schubert polynomials
Luis Serrano
;
Christian Stump
Propagation connectivity of random hypergraphs
Amin Coja-Oghlan
;
Mikael Onsjö
;
Osamu Watanabe
Pandiagonal sudokus
Walter Klotz
;
Torsten Sander
The smallest one-realization of a given set
Ping Zhao
;
Kefeng Diao
;
Kaishun Wang
Rainbow connection number and connectivity
Xueliang Li
;
Sujuan Liu
;
L. Sunil Chandran
;
Rogers Mathew
;
Deepak Rajendraprasad
Generating trees and pattern avoidance in alternating permutations
Joel Brewster Lewis
The positive minimum degree game on sparse graphs
József Balogh
;
András Pluhár
On Ryser's conjecture
P. E. Haxell
;
A. D. Scott
A note on random \(k\)-SAT for moderately growing \(k\)
Jun Liu
;
Zongsheng Gao
;
Ke Xu
On the number of Hamilton cycles in pseudo-random graphs
Michael Krivelevich
Symmetric chain decomposition of necklace posets
Vivek Dhand
Sequences of integers avoiding 3-term arithmetic progressions
Arun Sharma
Actions and identities on set partitions
Eric Marberg
Refined inversion statistics on permutations
Joshua Sack
;
Henning Úlfarsson
A construction for the hat problem on a directed graph
Rani Hod
;
Marcin Krzywkowski
Susceptibility in inhomogeneous random graphs
Svante Janson
;
Oliver Riordan
Bounds for identifying codes in terms of degree parameters
Florent Foucaud
;
Guillem Perarnau
Balanced line for a 3-colored point set in the plane
Sergey Bereg
;
Mikio Kano
The existence of strong complete mappings
Anthony B. Evans
Automorphism groups of rational circulant graphs
Mikhail Klin
;
István Kovács
The negative \(q\)-binomial
Shishuo Fu
;
V. Reiner
;
Dennis Stanton
;
Nathaniel Thiem
Properties of \(\theta\)-super positive graphs
Cheng Yeaw Ku
;
Kok Bin Wong
Plactic relations for \(r\)-domino tableaux
Müge Taşkin
The chromatic number and the least eigenvalue of a graph
Yi-Zheng Fan
;
Gui-Dong Yu
;
Yi Wang
The identities of additive binary arithmetics
Anton A. Klyachko
;
Ekaterina V. Menshova
On-line list colouring of complete multipartite graphs
Seog-Jin Kim
;
Young Soo Kwon
;
Daphne Der-Fen Liu
;
Xuding Zhu
Efficient oracles for generating binary bubble languages
J. Sawada
;
A. Williams
On the number of \(F\)-matchings in a tree
Hiu-Fai Law
Integral sets and Cayley graphs of finite groups
Roger C. Alperin
;
Brian L. Peterson
Rainbow-free 3-colorings of abelian groups
Amanda Montejano
;
Oriol Serra
Rainbow Hamilton cycles in uniform hypergraphs
Andrzej Dudek
;
Alan Frieze
;
Andrzej Ruciński
Random subgraphs in Cartesian powers of regular graphs
Felix Joos
The 2-adic valuation of plane partitions and totally symmetric plane partitions
William J. Keith
On the number of indecomposable permutations with a given number of cycles
Robert Cori
;
Claire Mathieu
;
John Michael Robson
The covered components polynomial: a new representation of the edge elimination polynomial
Martin Trinks
The effect of random edge removal on network degree sequence
Thomas DuBois
;
Stephen Eubank
;
Aravind Srinivasan
Two-part set systems
Péter L. Erdős
;
Dániel Gerbner
;
Nathan Lemons
;
Dhruv Mubayi
;
Cory Palmer
;
Balázs Patkós
Cubic vertex-transitive non-Cayley graphs of order \(8p\)
Jin-Xin Zhou
;
Yan-Quan Feng
A dice rolling game on a set of tori
Jeehoon Kang
;
Suh-Ryung Kim
;
Boram Park
Minimum clique number, chromatic number, and Ramsey numbers
Gaku Liu
Poset pinball, highest forms, and \((n-2,2)\) Springer varieties
Barry Dewitt
;
Megumi Harada
A combinatorial proof of the recurrence for rook paths
Emma Yu Jin
;
Markus E. Nebel
The chromatic index of a graph whose core has maximum degree 2
Mikio Kano
;
Saieed Akbari
;
Maryam Ghanbari
;
Mohammad Javad Nikmehr
The full automorphism group of Cayley graphs of \(\mathbb{Z}_p\times\mathbb{Z}_{p^2}\)
Edward Dobson
Combinatorial interpretations of particular evaluations of complete and elementary symmetric functions
Pietro Mongelli
Doubly biased maker-breaker connectivity game
Dan Hefetz
;
Mirjana Mikalački
;
Miloš Stojaković
Surprising symmetries in objects counted by Catalan numbers
Miklós Bóna
Avoiding \((m,m,m)\)-arrays of order \(n=2^k\)
Lina J. Andrén
Largest and smallest minimal percolating sets in trees
Eric Riedl
Hamiltonicity of minimum distance graphs of 1-perfect codes
Alexander Mikhailovich Romanov
On the Ramsey number \(R(4,6)\)
Geoffrey Exoo
Distortion of the hyperbolicity constant of a graph
Walter Carballosa
;
Domingo Pestana
;
José M. Rodríguez
;
José M. Sigarreta
On \(Q\)-polynomial association schemes of small class
Sho Suda
The tight upper bound for the number of matchings of tricyclic graphs
Ardeshir Dolati
;
Somayyeh Golalizadeh
Sommaire du
Fascicule no. 2
An algebraic exploration of dominating sets and Vizing's conjecture
Susan Margulies
;
I. V. Hicks
Strings of length 3 in grand-Dyck paths and the Chung-Feller property
Aristidis Sapounakis
;
Panagiotis Tsikouras
;
Ioannis Tasoulas
;
Kostas Manes
Monotone paths in random hypergraphs
Matteo Novaga
;
Pietro Majer
Demazure crystals, Kirillov-Reshetikhin crystals, and the energy function
Anne Schilling
;
Peter Tingley
Self-dual interval orders and row-Fishburn matrices
Sherry H. F. Yan
;
Yuexiao Xu
Extensions of Spivey's Bell number formula
Aimin Xu
A note on zero-sum 5-flows in regular graphs
Saieed Akbari
;
Narges Ghareghani
;
Gholamreza Khosrovshahi
;
Sanaz Zare
Multiranks for partitions into multi-colors
Roberta Rui Zhou
Non-recursively constructible recursive families of graphs
Colleen Bouey
;
Christina Graves
;
Aaron Ostrander
;
Gregory Palma
On the unitary Cayley graph of a ring
Dariush Kiani
;
Mohsen Molla Haji Aghaei
On log-concavity of a class of generalized Stirling numbers
Feng-Zhen Zhao
On the length of a partial independent transversal in a matroidal Latin square
Daniel Kotlar
;
Ran Ziv
On the rank function of a differential poset
Richard P. Stanley
;
Fabrizio Zanello
Generalized Ramsey numbers for graphs with three disjoint cycles versus a complete graph
Shinya Fujita
Sequences containing no 3-term arithmetic progressions
Janusz Dybizbański
Preserving log-convexity for generalized Pascal triangles
Moussa Ahmia
;
Hacène Belbachir
Arithmetic properties of overpartition pairs into odd parts
Lishuang Lin
Partitions with distinct multiplicities of parts: on an ``unsolved problem'' posed by Herbert Wilf
James Allen Fill
;
Svante Janson
;
Mark Daniel Ward
Distinguishing trees in linear time
Carlos Seara
;
Antoni Lozano
;
Mercè Mora
Tight co-degree condition for perfect matchings in 4-graphs
Andrzej Czygrinow
;
Vikram Kamat
An undecidability result on limits of sparse graphs
Endre Csóka
New Turán densities for 3-graphs
Rahil Baber
;
John Talbot
Some results on chromaticity of quasi-linear paths and cycles
Ioan Tomescu
Classification of cubic symmetric tricirculants
Istvan Kovacs
;
Klavdija Kutnar
;
Dragan Marusic
;
Steve Wilson
Improved upper bounds for planarization and series-parallelization of degree-bounded graphs
Keith Edwards
;
Graham Farr
The coin exchange problem and the structure of cube tilings
Andrzej Piotr Kisielewicz
;
Krzysztof Przeslawski
Distinguishability of infinite groups and graphs
Simon M Smith
;
Thomas W Tucker
;
Mark E Watkins
The existence of near generalized balanced tournament designs
Chengmin Wang
;
Jie Yan
The \(1/3\)-\(2/3\) conjecture for \(N\)-free ordered sets
Imed Zaguia
The Ramsey number of loose triangles and quadrangles in hypergraphs
Andras Gyarfas
;
Ghaffar Raeisi
Drawing Hamiltonian cycles with no large angles
Adrian Dumitrescu
;
János Pach
;
Géza Tóth
Lower bounds on the obstacle number of graphs
Padmini Mukkamala
;
János Pach
;
Dömötör Pálvölgyi
Sum and shifted-product subsets of product-sets over finite rings
Anh Vinh Le
A positive combinatorial formula for the complexity of the \(q\)-analog of the \(n\)-cube
Murali Krishna Srinivasan
Improving the use of cyclic zippers in finding lower bounds for van der Waerden numbers
John Rabung
;
Mark Lotts
Inequalities between gamma-polynomials of graph-associahedra
Natalie Aisbett
Probabilities of Boolean functions given by random implicational formulas
Antoine Genitrini
;
Bernhard Gittenberger
;
Veronika Kraus
;
Cécile Mailler
Optimal lower bound for 2-identifying codes in the hexagonal grid
Ville Junnila
;
Tero Laihonen
Injective envelopes and projective covers of quivers
Will Grilliette
Locally identifying coloring of graphs
Louis Esperet
;
Sylvain Gravier
;
Mickaël Montassier
;
Pascal Ochem
;
Aline Parreau
Maximal percolation time in hypercubes under 2-bootstrap percolation
Michał Przykucki
On matchings in hypergraphs
Peter Frankl
;
Tomasz Łuczak
;
Katarzyna Mieczkowska
Stamp foldings, semi-meanders, and open meanders: fast generation algorithms
Joe Sawada
;
Roy Li
Binomial edge ideals of graphs
Dariush Kiani
;
Sara Saeedi
Vertex isoperimetric inequalities for a family of graphs on \(\mathbb{Z}^k\)
Ellen Veomett
;
Andrew John Radcliffe
Some quotients of chain products are symmetric chain orders
Dwight Duffus
;
Jeremy McKibben-Sanders
;
Kyle Thayer
Statistics of blocks in \(k\)-divisible non-crossing partitions
Octavio Arizmendi
Orthogonal systems in vector spaces over finite rings
Thang Van Pham
;
Anh Vinh Le
Alternating permutations with restrictions and standard Young tableaux
Yuexiao Xu
;
Sherry H. F. Yan
On \((K_{q},k)\) stable graphs with small \(k\)
Jean-Luc Fouquet
;
Henri Thuillier
;
Jean-Marie Vanherpe
;
Adam Paweł Wojda
The number of nilpotent semigroups of degree 3.
Andreas Distler
;
J. D. Mitchell
Rainbow matchings of size \(\delta(G)\) in properly edge-colored graphs
Jennifer Diemunsch
;
Michael Ferrara
;
Allan Lo
;
Casey Moffatt
;
Florian Pfender
;
Paul S Wenger
The \(n\)-card problem, stochastic matrices, and the extreme principle
Justin H.C. Chan
;
Jonathan Jedwab
The decomposition algorithm for skew-symmetrizable exchange matrices
Weiwen Gu
Expansions of \(k\)-Schur functions in the affine nilcoxeter algebra
Chris Berg
;
Nantel Bergeron
;
Steven Pon
;
Mike Zabrocki
Sommaire du
Fascicule no. 3
The cyclic sieving phenomenon for non-crossing forests
Stefan Kluge
Ramsey properties of random subgraphs of pseudo-random graphs
Jia Shen
Matchings, cycle bases, and the maximum genus of a graph
Michal Kotrbčík
;
Martin Škoviera
An enumeration of flags in finite vector spaces
C. Ryan Vinroot
Minimal covers of the Archimedean tilings. I
Daniel Pellicer
;
Gordon Williams
Counting packings of generic subsets in finite groups
Roland Bacher
Combinatorial logarithm and point-determining cographs
Ji Li
Reflexive polytopes of higher index and the number 12
Alexander M. Kasprzyk
;
Benjamin Nill
Parity types, cycle structures and autotopisms of Latin squares
Daniel Kotlar
On Zudilin's \(q\)-question about Schmidt's problem
Victor J. W. Guo
;
Jiang Zeng
Block designs with SDP parameters
Harold Ward
A short proof of the odd-girth theorem
Edwin R. van Dam
;
Miquel Angel Fiol
Cospectral graphs and regular orthogonal matrices of level 2
Aida Abiad
;
Willem H Haemers
Polyhedral embeddings of snarks with arbitrary nonorientable genera
Wenzhong Liu
;
Yichao Chen
On a recurrence arising in graph compression
Yongwook Choi
;
Charles Knessl
;
Wojciech Szpankowski
Degrees in oriented hypergraphs and Ramsey \(p\)-chromatic number
Yair Caro
;
Adriana Hansberg
Planar graphs of maximum degree six without 7-cycles are class one
Danjun Huang
;
Weifan Wang
A complete classification of doubly even self-dual codes of length 40
Koichi Betsumiya
;
Masaaki Harada
;
Akihiro Munemasa
Roman domination number of the Cartesian products of paths and cycles
Polona Pavlič
;
Janez Žerovnik
The enumeration of three pattern classes using monotone grid classes
Michael Albert
;
Mike Atkinson
;
Robert Brignall
Viewing determinants as nonintersecting lattice paths yields classical determinantal identities bijectively
Markus Fulmek
Non-contiguous pattern avoidance in binary trees
Michael Dairyko
;
Lara Pudwell
;
Samantha Tyner
;
Casey Wynn
Graph cospectrality using neighborhood matrices
Aline Duarte Bessa
;
Ivan Carmo Rocha-Neto
;
Suani Tavares Rubim de Pinho
;
Roberto Fernandes Silva Andrade
;
Thierry Correa Petit Lobao
Enumerating lattice paths touching or crossing the diagonal at a given number of lattice points
Michael Z. Spivey
Two permutation classes related to the bubble sort operator
Marilena Barnabei
;
Flavio Bonetti
;
Matteo Silimbani
Baxter permutations, maj-balances, and positive braids
Sen-Peng Eu
;
Tung-Shan Fu
;
Yeh-Jong Pan
;
Chien-Tai Ting
Partition of graphs and hypergraphs into monochromatic connected parts
Shinya Fujita
;
Michitaka Furuya
;
András Gyárfás
;
Ágnes Tóth
Some constructions of general covering designs
Federico Montecalvo
Biembeddings of metacyclic groups and triangulations of orientable surfaces by complete graphs
Michael John Grannell
;
Martin Knor
The rotor-router group of directed covers of graphs
Wilfried Huss
;
Ecaterina Sava
On short zero-sum subsequences of zero-sum sequences
Yushuang Fan
;
Weidong Gao
;
Guoqing Wang
;
Qinghai Zhong
;
Jujuan Zhuang
Triangle-free triangulations, hyperplane arrangements and shifted tableaux
Ron Adin
;
Yuval Roichman
Polynomials with real zeros and compatible sequences
Li Liu
Generalized Galois numbers, inversions, lattice paths, ferrers diagrams and limit theorems
Svante Janson
Existence of 2-\((v,k,1)\) designs admitting a block-transitive group of affine type
Ding Shifeng
;
Liu Weijun
On a matrix representation for polynomially recursive sequences
Christophe Reutenauer
Independent sets in graphs with given minimum degree
James Alexander
;
Jonathan Cutler
;
Tim Mink
Dissimilarity maps on trees and the representation theory of \(\mathrm{GL}_n(\mathbb{C})\)
Christopher Manon
Shi threshold arrangement
Seunghyun Seo
Turán \(H\)-densities for 3-graphs
Victor Falgas-Ravry
;
Emil R. Vaughan
Euler's partition theorem with upper bounds on multiplicities
William Y.C. Chen
;
Ae Ja Yee
;
Albert J. W. Zhu
Enumeration of Golomb rulers and acyclic orientations of mixed graphs
Matthias Beck
;
Tristram Bogart
;
Tu Pham
Expected patterns in permutation classes
Cheyne Homberger
Parity index of binary words and powers of prime words
Aleksandar Ilić
;
Sandi Klavžar
;
Yoomi Rho
Directed animals, quadratic systems and rewriting systems
Jean-François Marckert
The vertical profile of embedded trees
Mireille Bousquet-Mélou
;
Guillaume Chapuy
Recurrence relations and splitting formulas for the domination polynomial
Tomer Kotek
;
James Preen
;
Frank Simon
;
Peter Tittmann
;
Martin Trinks
Sommaire du
Fascicule no. 4
The lowest-degree polynomial with nonnegative coefficients divisible by the \(n\)-th cyclotomic polynomial
John P. Steinberger
Constructions of bipartite and bipartite-regular hypermaps
Rui Duarte
Invariant principal order ideals under Foata's transformation
Teresa X.S. Li
;
Melissa Y.F. Miao
Some constant weight codes from primitive permutation groups
Derek H. Smith
;
Roberto Montemanni
Rainbow connection of sparse random graphs
Alan Frieze
;
Charalampos E. Tsourakakis
Uniquely \(K_r\)-saturated graphs
Stephen G. Hartke
;
Derrick Stolee
On extensions of the Alon-Tarsi Latin square conjecture
Daniel Kotlar
Orientations, semiorders, arrangements, and parking functions
Sam Hopkins
;
David Perkinson
The closed knight tour problem in higher dimensions
Joshua Erde
;
Bruno Golénia
;
Sylvain Golénia
Maximum frustration in bipartite signed graphs
Garry S Bowlin
Repetition threshold for circular words
Irina A. Gorbunova
Hypohamiltonian graphs and their crossing number
Carol T. Zamfirescu
Spectral properties of unitary Cayley graphs of finite commutative rings
Xiaogang Liu
;
Sanming Zhou
Locally restricted compositions. IV. Nearly free large parts and gap-freeness
Edward A. Bender
;
E. Rodney Canfield
;
Zhicheng Gao
New proofs of determinant evaluations related to plane partitions
Hjalmar Rosengren
Ehrhart \(f^*\)-coefficients of polytopal complexes are non-negative integers
Felix Breuer
Finite homomorphism-homogeneous permutations via edge colourings of chains
Igor Dolinka
;
Éva Jungábel
Large 2-coloured matchings in 3-coloured complete hypergraphs
Tamás Terpai
Canonical decompositions of affine permutations, affine codes, and split \(k\)-Schur functions
Tom Denton
On codes that are invariant under the affine group.
Peter Sin
A simple branching process approach to the phase transition in \(G_{n,p}\)
Béla Bollobás
;
Oliver Riordan
Schur polynomials, banded Toeplitz matrices and widom's formula
Per Alexandersson
A note on automorphisms of the infinite-dimensional hypercube graph
Mark Pankov
Large incidence-free sets in geometries
Stefaan De Winter
;
Jeroen Schillewaert
;
Jacques Verstraete
Distance powers and distance matrices of integral Cayley graphs over abelian groups
Walter Klotz
;
Torsten Sander
Irreducible cycles and points in special position in moduli spaces for tropical curves
Andreas Gathmann
;
Franziska Schroeter
On the parity of certain coefficients for a \(q\)-analogue of the Catalan numbers
Kendra Killpatrick
Properties of random difference graphs
Christopher Ross
Partially ordinal sums and \(P\)-partitions
Daniel K. Du
;
Qing-Hu Hou
Resolving sets and semi-resolving sets in finite projective planes
Tamás Héger
;
Marcella Takáts
A construction of short sequences containing all permutations of a set as subsequences
Sasa Radomirovic
Identifying vertex covers in graphs
Michael A Henning
;
Anders Yeo
Structure of colored complete graphs free of proper cycles
Vincent Coll
;
Colton Magnant
;
Kathleen Ryan
Some convolution identities and an inverse relation involving partial Bell polynomials
Daniel Birmajer
;
Juan B. Gil
;
Michael D. Weiner
The (signless Laplacian) spectral radii of connected graphs with prescribed degree sequences
Muhuo Liu
Ramsey numbers \(R(K_3, G)\) for graphs of order 10
Gunnar Brinkmann
;
Jan Goedgebeur
;
Jan-Christoph Schlage-Puchta
The hitting time of rainbow connection number two
Annika Heckel
;
Oliver Riordan
A proof of Erdős-Fishburn's conjecture for \(g(6)=13\)
Wei Xianglin
Combinatorial expansions in \(K\)-theoretic bases
Jason Bandlow
;
Jennifer Morse
Münchhausen matrices
Michael Brand
Counting bases of representable matroids
Michael Snook
Hopf algebra of building sets.
Vladimir Grujić
;
Tanja Stojadinović
An ordered Turán problem for bipartite graphs
Craig Timmons
Optimal divisibility conditions for loose Hamilton cycles in random hypergraphs
Andrzej Dudek
;
Alan Frieze
;
Po-Shen Loh
;
Shelley Speiss
\(\Gamma \)-species and the enumeration of \(k\)-trees
Andrew Gainer-Dewar
The tau constant and the edge connectivity of a metrized graph
Zubeyir Cinkir
Three color Ramsey numbers for graphs with at most 4 vertices
Luis Boza
;
Janusz Dybizbański
;
Tomasz Dzido
Further analysis on the total number of subtrees of trees
Shuchao Li
;
Shujing Wang
On cross-intersecting families of set partitions
Cheng Yeaw Ku
;
Kok Bin Wong
List-coloring graphs on surfaces with varying list-sizes
Alice M. Dean
;
Joan P. Hutchinson
On the spanning trees of the hypercube and other products of graphs
Olivier Bernardi
On the number of partition weights with Kostka multiplicity one
Zachary Gates
;
Brian Goldman
;
C. Ryan Vinroot
Connectivity for random graphs from a weighted bridge-addable class
Colin McDiarmid
The number of ways to assemble a graph
Andrew Vince
;
Miklós Bóna
Generalized Alcuin's sequence
Daniel Panario
;
Murat Sahin
;
Qiang Wang
Identifying codes of lexicographic product of graphs
Min Feng
;
Min Xu
;
Kaishun Wang