Parcourir par
Collections
Sources
Geodesic
Parcourir par
Collections
Sources
The electronic journal of combinatorics
Tome 21 (2014)
Précédent
Suivant
Sommaire du
Fascicule no. 1
Vertex-decomposable graphs, codismantlability, Cohen-Macaulayness, and Castelnuovo-Mumford regularity
Türker Bıyıkoğlu
;
Yusuf Civan
Avoider-forcer games on hypergraphs with small rank
Małgorzata Bednarska-Bzdęga
Diagrammatic description of \(c\)-vectors and \(d\)-vectors of cluster algebras of finite type
Tomoki Nakanishi
;
Salvatore Stella
Distance-regular graphs with an eigenvalue \(-k \theta \leq 2-k\)
Sejeong Bang
A decomposition algorithm for noncrossing trees
Lun Lv
;
Sabrina X.M. Pang
A simple proof for the number of tilings of quartered Aztec diamonds
Tri Lai
Tiling a strip with triangles
John Bodeen
;
Steve Butler
;
Taekyoung Kim
;
Xiyuan Sun
;
Shenzhi Wang
Colorful subhypergraphs in Kneser hypergraphs
Frédéric Meunier
Square-free words with square-free self-shuffles
James D. Currie
;
Kalle Saari
Generalized Stirling numbers and hyper-sums of powers of binomials coefficients
Claudio de J. Pita-Ruiz V.
From clutters to matroids
Jaume Martí-Farré
Genus distributions for iterated claws
Jonathan L. Gross
;
Imran F. Khan
;
Mehvish I. Poshni
On a sumset problem for integers
Shan-Shan Du
;
Hui-Qin Cao
;
Zhi-Wei Sun
Arcs with large conical subsets in Desarguesian planes of even order
Kris Coolsaet
;
Heide Sticker
On the directed Oberwolfach problem with equal cycle lengths
Andrea Burgess
;
Mateja Šajna
Endomorphism breaking in graphs
Wilfried Imrich
;
Rafał Kalinowski
;
Florian Lehner
;
Monika Pilśniak
Some extremal problems for hereditary properties of graphs
Vladimir Nikiforov
Structural transition in random mappings
Jennie C. Hansen
;
Jerzy Jaworski
Biclique covers and partitions
Trevor Pinto
Symmetric alcoved polytopes
Annette Werner
;
Josephine Yu
Beyond sum-free sets in the natural numbers
Sophie Huczynska
Doubly even orientable closed 2-cell embeddings of the complete graph
Mike J Grannell
;
Thomas A McCourt
A note on irreducible maps with several boundaries
J. Bouttier
;
E. Guitter
Forcing \(k\)-repetitions in degree sequences
Yair Caro
;
Asaf Shapira
;
Raphael Yuster
On the Kirchhoff and the Wiener indices of graphs and block decomposition
Ashkan Nikseresht
;
Zahra Sepasdar
Constant rank-distance sets of Hermitian matrices and partial spreads in Hermitian polar spaces
Rod Gow
;
Michel Lavrauw
;
John Sheekey
;
Frédéric Vanhove
How many colors guarantee a rainbow matching?
Roman Glebov
;
Benny Sudakov
;
Tibor Szabó
On counterexamples to a conjecture of Wills and Ehrhart polynomials whose roots have equal real parts
Matthias Henze
On the positive moments of ranks of partitions
William Y. C. Chen
;
Kathy Q. Ji
;
Erin Y. Y. Shen
Long paths and cycles in random subgraphs of \(\mathcal{H}\)-free graphs
Michael Krivelevich
;
Wojciech Samotij
Generalised knight's tours
Nina Kamčev
On divisibility of convolutions of central binomial coefficients
Mark Roger Sepanski
Some new binomial sums related to the Catalan triangle
Yidong Sun
;
Fei Ma
On a conjecture concerning the Petersen graph. II
Michael Plummer
;
Xiaoya Zha
About half permutations
Simone Rinaldi
;
Samanta Socci
Self-dual spherical grids
Jack E. Graver
;
Elizabeth J. Hartung
The Goldman-Rota identity and the Grassmann scheme
Murali K. Srinivasan
A new lower bound on the independence number of a graph and applications
Michael A. Henning
;
Christian Löwenstein
;
Justin Southey
;
Anders Yeo
Schur times Schubert via the Fomin-Kirillov algebra
Karola Mészáros
;
Greta Panova
;
Alexander Postnikov
A set and collection lemma
Vadim E. Levit
;
Eugen Mandrescu
Crossings in grid drawings
Vida Dujmović
;
Pat Morin
;
Adam Sheffer
Extremal problems for subset divisors
Tony Huynh
Polynomial sequences of binomial-type arising in graph theory
Jonathan Schneider
The unreasonable ubiquitousness of quasi-polynomials
Kevin Woods
On the number of spanning trees in random regular graphs
Catherine Greenhill
;
Matthew Kwan
;
David Wind
Rainbow path and color degree in edge colored graphs
Anita Das
;
S. V. Subrahmanya
;
P. Suresh
The gap structure of a family of integer subsets
André Bernardino
;
Rui Pacheco
;
Manuel Silva
Treewidth of the Kneser graph and the Erdős-Ko-Rado theorem
Daniel J. Harvey
;
David R. Wood
Nested recursions, simultaneous parameters and tree superpositions
Abraham Isgur
;
Vitaly Kuznetsov
;
Mustazee Rahman
;
Stephen Tanny
Logarithmic tree-numbers for acyclic complexes
Hyuk Kim
;
Woong Kook
A generalization of Aztec diamond theorem. I
Tri Lai
On the number of orientations of random graphs with no directed cycles of a given length
P. Allen
;
Y. Kohayakawa
;
G. O. Mota
;
R. F. Parente
Non-normal very ample polytopes and their holes
Akihiro Higashitani
On regular hypergraphs of high girth
David Ellis
;
Nathan Linial
Edge-decomposition of graphs into copies of a tree with four edges
János Barát
;
Dániel Gerbner
Total colorings of \(F_5\)-free planar graphs with maximum degree 8
Jian Chang
;
Jian-Liang Wu
;
Hui-Juan Wang
;
Zhan-Hai Guo
Remarks on a conjecture of Barát and Tóth
Atílio G. Luiz
;
R. Bruce Richter
Non-existence of point-transitive \(2\)-\((106, 6, 1)\) designs
Haiyan Guan
;
Shenglin Zhou
Equipopularity classes of 132-avoiding permutations
Lynn Chua
;
Krishanu Roy Sankar
Semiarcs with long secants
Bence Csajbók
Minimal crystallizations of 3-manifolds
Biplab Basak
;
Basudeb Datta
Equicovering subgraphs of graphs and hypergraphs
Ilkyoo Choi
;
Jaehoon Kim
;
Amelia Tebbe
;
Douglas B. West
The proof of the removable pair conjecture for fractional dimension.
Csaba Biró
;
Peter Hamburger
;
Attila Pór
Online Ramsey theory for planar graphs
Šárka Petříčková
Convolution identities for Bernoulli and Genocchi polynomials
Takashi Agoh
Certificates for properties of stability polynomials of graphs
Ranjie Mo
;
Graham Farr
;
Kerri Morgan
A group action on derangements
Hua Sun
;
Yi Wang
A general central limit theorem for shape parameters of \(m\)-ary tries and PATRICIA tries
Michael Fuchs
;
Chung-Kuei Lee
Monomial ideals with primary components given by powers of monomial prime ideals
Jürgen Herzog
;
Marius Vladoiu
Sommaire du
Fascicule no. 2
Counting words with Laguerre series
Jair Taylor
Revstack sort, zigzag patterns, descent polynomials of \(t\)-revstack sortable permutations, and Steingrímsson's sorting conjecture
Mark Dukes
Some new characterizations of graph colorability and of blocking sets of projective spaces
Uwe Schauz
Counting symmetric nilpotent matrices
Andries E. Brouwer
;
Rod Gow
;
John Sheekey
Degree Ramsey numbers of closed blowups of trees
Paul Horn
;
Kevin G. Milans
;
Vojtěch Rödl
Totally symmetric functions are reconstructible from identification minors
Erkko Lehtonen
Application of entropy compression in pattern avoidance
Pascal Ochem
;
Alexandre Pinlou
Packing tree factors in random and pseudo-random graphs
Deepak Bal
;
Alan Frieze
;
Michael Krivelevich
;
Po-Shen Loh
A simple formula for the series of constellations and quasi-constellations with boundaries
Gwendal Collet
;
Éric Fusy
Signed excedance enumeration in the hyperoctahedral group
Sivaramakrishnan Sivasubramanian
On the Möbius function of permutations with one descent
Jason P. Smith
Progress on Dirac's conjecture
Michael S. Payne
;
David R. Wood
Matching covered graphs with three removable classes
Marcelo H. de Carvalho
;
Charles H. C. Little
Matroid and Tutte-connectivity in infinite graphs
Henning Bruhn
Tree reconstruction from triplet cover distances
Katharina T. Huber
;
Mike Steel
The Ihara zeta function of the infinite grid
Bryan Clair
Zero-sum magic labelings and null sets of regular graphs
Saieed Akbari
;
Farhad Rahmati
;
Sanaz Zare
On fractional realizations of graph degree sequences
Michael D. Barrus
Colour-blind can distinguish colour pallets
Jakub Przybyło
Bruhat order on fixed-point-free involutions in the symmetric group
Matthew Watson
The parity of a thicket
M. H. de Carvalho
;
C. H. C. Little
New Ramsey classes from old
Manuel Bodirsky
A note on coloring line arrangements
Eyal Ackerman
;
János Pach
;
Rom Pinchasi
;
Radoš Radoičić
;
Géza Tóth
Total transversals and total domination in uniform hypergraphs
Csilla Bujtás
;
Michael Henning
;
Zsolt Tuza
;
Anders Yeo
The combinatorics of \(\mathsf{A}_2\)-webs
Georgia Benkart
;
Soojin Cho
;
Dongho Moon
The topology of competitively constructed graphs
Alan Frieze
;
Wesley Pegden
A combinatorial identity of multiple zeta values with even arguments
Shifeng Ding
;
Lihua Feng
;
Weijun Liu
On a general \(q\)-identity
Aimin Xu
On the group of alternating colored permutations.
Eli Bagno
;
David Garber
;
Toufik Mansour
On the Buratti-Horak-Rosa conjecture about Hamiltonian paths in complete graphs
Anita Pasotti
;
Marco Antonio Pellegrini
A pseudoline counterexample to the strong Dirac conjecture
Ben Lund
;
George B. Purdy
;
Justin W. Smith
Combinatorial study of Dellac configurations and \(q\)-extended normalized median Genocchi numbers
Ange Bigeni
A note on covering edge colored hypergraphs by monochromatic components
Shinya Fujita
;
Michitaka Furuya
;
András Gyárfás
;
Ágnes Tóth
The extendability of matchings in strongly regular graphs
Sebastian M Cioabă
;
Weiqiang Li
Hyperoctahedral Eulerian idempotents, Hodge decompositions, and signed graph coloring complexes
Benjamin Braun
;
Sarah Crown Rundell
Monochromatic loose-cycle partitions in hypergraphs
András Gyárfás
;
Gábor Sárközy
An elementary proof of Jin's theorem with a bound
Mauro Di Nasso
A note on independent sets in graphs with large minimum degree and small cliques
Jeremy Lyle
On the hyperbolicity of random graphs
Dieter Mitsche
;
Paweł Prałat
Enumeration of bipartite graphs and bipartite blocks
Andrew Gainer-Dewar
;
Ira M. Gessel
Bijective proofs of partition identities of Macmahon, Andrews, and Subbarao
Shishuo Fu
;
James Allen Sellers
A bijective proof of Shapiro's Catalan convolution
Péter Hajnal
;
Gábor V. Nagy
New multiple harmonic sum identities
Roberto Tauraso
;
Helmut Prodinger
General restriction of \((s,t)\)-Wythoff's game
Wen An Liu
;
Haiyan Li
Congruences of finite summations of the coefficients in certain generating functions
Po-Yi Huang
;
Shu-Chung Liu
;
Yeong-Nan Yeh
Split \((n+t)\)-color partitions and Gordon-McIntosh eight order mock theta functions
A.K. Agarwal
;
G. Sood
Equivalence classes of permutations modulo replacements between 123 and two-integer patterns
Vahid Fazel-Rezai
Random threshold digraphs
Elizabeth Reilly
;
Edward Scheinerman
;
Yiguang Zhang
Switching in one-factorisations of complete graphs
Petteri Kaski
;
André de Souza Medeiros
;
Patric R.J. Östergård
;
Ian M. Wanless
Refining enumeration schemes to count according to permutation statistics
Andrew M. Baxter
Counting 2-connected 4-regular maps on the projective plane
Shude Long
;
Han Ren
Order polynomials and Pólya's enumeration theorem.
Katharina Jochemko
More on the Wilson \(W_{tk}(v)\) matrices
M.H. Ahmadi
;
N. Akhlaghinia
;
G.B. Khosrovshahi
;
Ch. Maysoori
Proof of two divisibility properties of binomial coefficients conjectured by Z.-W. Sun
Victor J. W. Guo
Partitions of \(\mathbb Z_m\) with the same weighted representation functions
Zhenhua Qu
Lines in higgledy-piggledy arrangement
Szabolcs L. Fancsali
;
Péter Sziklai
Extremal edge polytopes
Tuan Tran
;
Günter M. Ziegler
Sommaire du
Fascicule no. 3
A spectral equivalent condition of the \(P\)-polynomial property for association schemes
Hiroshi Nozaki
;
Hirotake Kurihara
Consecutive up-down patterns in up-down permutations
Jeffrey B. Remmel
A characteristic factor for the 3-term IP Roth theorem in \(\mathbb{Z}_3^\mathbb{N}\)
Randall McCutcheon
;
Alistair Windsor
On fence patrolling by mobile agents
Adrian Dumitrescu
;
Anirban Ghosh
;
Csaba D. Tóth
Arc-transitive dihedral regular covers of cubic graphs
Jicheng Ma
Nordhaus-Gaddum type inequalities for Laplacian and signless Laplacian eigenvalues
F. Ashraf
;
B. Tayfeh-Rezaie
The minimum number of nonnegative edges in hypergraphs
Hao Huang
;
Benny Sudakov
On the Cayley isomorphism problem for Cayley objects of nilpotent groups of some orders
Edward Dobson
Ascent-descent Young diagrams and pattern avoidance in alternating permutations
Ravi Jagadeesan
The expected characteristic and permanental polynomials of the random Gram matrix
Jacob G. Martin
;
E. Rodney Canfield
A counterexample to a question of Hof, Knill and Simon
Sébastien Labbé
Counting results for thin Butson matrices
Teo Banica
Trivial meet and join within the lattice of monotone triangles.
John Engbers
;
Adam Hammett
On the strong partition dimension of graphs
Ismael González Yero
The weak order on pattern-avoiding permutations
Brian Drake
An Erdős-Ko-Rado theorem for permutations with fixed number of cycles
Cheng Yeaw Ku
;
Kok Bin Wong
Some identities involving the partial sum of \(q\)-binomial coefficients
Bing He
Minimum-weight edge discriminators in hypergraphs
Bhaswar B. Bhattacharya
;
Sayantan Das
;
Shirshendu Ganguly
The maximal length of a \(k\)-separator permutation
Benjamin Gunby
Grid minors in damaged grids
David Eppstein
Extremal problems for the \(p\)-spectral radius of graphs
Liying Kang
;
Vladimir Nikiforov
On saturated \(k\)-Sperner systems
Natasha Morrison
;
Jonathan A. Noel
;
Alex Scott
On the number of colored Birch and Tverberg partitions
Stephan Hell
Bounding sequence extremal functions with formations
Jesse Geneson
;
Rohil Prasad
;
Jonathan Tidor
Counting the palstars
L. Bruce Richmond
;
Jeffrey O Shallit
A combinatorial proof of the non-vanishing of Hankel determinants of the Thue-Morse sequence
Yann Bugeaud
;
Guo-Niu Han
Note on the subgraph component polynomial
Yunhua Liao
;
Yaoping Hou
Resolving a conjecture on degree of regularity of linear homogeneous equations
Noah Golowich
Additional constructions to solve the generalized Russian cards problem using combinatorial designs
Colleen M. Swanson
;
Douglas R. Stinson
Capturing the drunk robber on a graph
Natasha Komarov
;
Peter Winkler
On compact symmetric regularizations of graphs
R. Vandell
;
M. Walsh
;
W. D. Weakley
On symmetry of uniform and preferential attachment graphs
Abram Magner
;
Svante Janson
;
Giorgos Kollias
;
Wojciech Szpankowski
A \(q\)-queens problem. I: General theory
Seth Chaiken
;
Christopher R. H. Hanusa
;
Thomas Zaslavsky
On the typical structure of graphs in a monotone property
Svante Janson
;
Andrew J. Uzzell
Arithmetic properties of overcubic partition pairs
Bernard L.S. Lin
Orthogonality and minimality in the homology of locally finite graphs
Reinhard Diestel
;
Julian Pott
The generating function for total displacement
Mathieu Guay-Paquet
;
Kyle Petersen
A Laurent series proof of the Habsieger-Kadell \(q\)-Morris identity
Xin Guoce
;
Zhou Yue
Distance-restricted matching extension in triangulations of the torus and the Klein bottle
Robert E.L. Aldred
;
Jun Fujisawa
Bounding the distinguishing number of infinite graphs and permutation groups
Simon M. Smith
;
Mark E. Watkins
A Schur-like basis of \(\mathsf{NSym}\) defined by a Pieri rule
John Maxwell Campbell
;
Karen Feldman
;
Jennifer Light
;
Pavel Shuldiner
;
Yan Xu
A polynomial invariant and duality for triangulations
Vyacheslav Krushkal
;
David Renardy
Proof of the list edge coloring conjecture for complete graphs of prime degree
Uwe Schauz
Energies and structure of additive sets
Shkredov Ilya
A note on a Ramsey-type problem for sequences
Andrzej Dudek
Schur-positivity in a square
Cristina Ballantine
;
Rosa Orellana
Computing the Tutte polynomial of a matroid from its lattice of cyclic flats
Jens Niklas Eberhardt
Sommaire du
Fascicule no. 4
The optimal drawings of \(K_{5,n}\)
César Hernández-Vélez
;
Carolina Medina
;
Gelasio Salazar
Limits of Boolean functions on \(\mathbb{F}_p^n\)
Hamed Hatami
;
Pooya Hatami
;
James Hirst
Permutation reconstruction from differences
Marzio De Biasi
Isometric embeddings of half-cube graphs in half-spin Grassmannians
Mark Pankov
An extension of Turán's theorem, uniqueness and stability
Peter Allen
;
Julia Böttcher
;
Jan Hladký
;
Diana Piguet
Coxeter-Knuth graphs and a signed little map for type B reduced words
Sara Billey
;
Zachary Hamaker
;
Austin Roberts
;
Benjamin Young
Enumerating Hamiltonian cycles
Ville H. Pettersson
New infinite families of congruences modulo 8 for partitions with even parts distinct
Ernest X. W. Xia
Graph homomorphisms between trees
Péter Csikvári
;
Zhicong Lin
The range of a simple random walk on \(\mathbb{Z}\): an elementary combinatorial approach
Bernhard A. Moser
Operators of equivalent sorting power and related Wilf-equivalences
Michael Albert
;
Mathilde Bouvel
\(k\)-fold Sidon sets
Javier Cilleruelo
;
Craig Timmons
On sets with few intersection numbers in finite projective and affine spaces
Nicola Durante
Mutations of fake weighted projective spaces
Tom Coates
;
Samuel Gonshaw
;
Alexander Kasprzyk
;
Navid Nabijou
The Combinatorial Nullstellensätze revisited
Pete L. Clark
Decomposing labeled interval orders as pairs of permutations
Anders Claesson
;
Stuart A. Hannah
Chromatic bounds on orbital chromatic roots
Dae Hyun Kim
;
Alexander H. Mun
;
Mohamed Omar
Enumerating permutations by their run structure
Christopher J. Fewster
;
Daniel Siemssen
Subset Glauber dynamics on graphs, hypergraphs and matroids of bounded tree-width
Magnus Bordewich
;
Ross J. Kang
Schreier graphs of an extended version of the binary adding machine.
Daniele D'Angeli
On the subpartitions of the ordinary partitions. II
Byungchan Kim
;
Eunmi Kim
Turán problems on non-uniform hypergraphs
J. Travis Johnston
;
Linyuan Lu
Counting permutations by alternating descents
Ira M. Gessel
;
Yan Zhuang
Some spectral properties of uniform hypergraphs
Jiang Zhou
;
Lizhu Sun
;
Wenzhe Wang
;
Changjiang Bu
Avoiding 7-circuits in 2-factors of cubic graphs
Robert Lukoťka
On \(m\)-closed graphs
Leila Sharifan
;
Masoumeh Javanbakht
Schubert polynomials and \(k\)-Schur functions
Carolina Benedetti
;
Nantel Bergeron
Integer decomposition property of dilated polytopes
David A. Cox
;
Christian Haase
;
Takayuki Hibi
;
Akihiro Higashitani
A 64-dimensional counterexample to Borsuk's conjecture
Thomas Jenrich
;
Andries E. Brouwer
Shattering-extremal set systems of VC dimension at most 2
Tamás Mészáros
;
Lajos Rónyai
Kauffman's clock lattice as a graph of perfect matchings: a formula for its height
Moshe Cohen
;
Mina Teicher
An abstraction of Whitney's broken circuit theorem
Klaus Dohmen
;
Martin Trinks
A combinatorial approach to Ebert's hat game with many colors
Uthaipon Tantipongpipat
Bruhat order on partial fixed point free involutions.
Mahir Bilen Can
;
Yonah Cherniavsky
;
Tim Twelbeck
Structure coefficients of the Hecke algebra of \((\mathcal{S}_{2n},\mathcal{B}_n)\)
Omar Tout
On floors and ceilings of the \(k\)-Catalan arrangement
Marko Thiel
Face-width of Pfaffian braces and polyhex graphs on surfaces
Dong Ye
;
Heping Zhang
The number of moves of the largest disc in shortest paths on Hanoi graphs
Simon Aumann
;
Katharina A.M. Götz
;
Andreas M. Hinz
;
Ciril Petr
A slight improvement to the colored Bárány's theorem
Zilin Jiang
A combinatorial proof for Cayley's identity
Markus Fulmek
The Ramsey numbers of paths versus wheels: a complete solution
Binlong Li
;
Bo Ning
Ramsey precompact expansions of homogeneous directed graphs
Jakub Jasiński
;
Claude Laflamme
;
Lionel Nguyen Van Thé
;
Robert Woodrow
Equidistributed statistics on matchings and permutations
Niklas Eriksen
;
Jonas Sjöstrand
Combinatorial nullstellensatz modulo prime powers and the parity argument
László Varga
On groups all of whose undirected Cayley graphs of bounded valency are integral
István Estélyi
;
István Kovács
Enumeration of tilings of quartered Aztec rectangles
Tri Lai
The game chromatic number of dense random graphs
Ralph Keusch
;
Angelika Steger
A superlocal version of Reed's conjecture
Katherine Edwards
;
Andrew D. King
Bell numbers modulo a prime number, traces and trinomials
Luis H. Gallardo
;
Olivier Rahavandrainy
The degree-diameter problem for circulant graphs of degree 8 and 9
Robert R. Lewis
Growth rates of geometric grid classes of permutations
David Bevan
Infinite graphs with finite 2-distinguishing cost
Debra Boutin
;
Wilfried Imrich
On bipartite \(Q\)-polynomial distance-regular graphs with \(c_2 \leqslant 2\)
Stefko Miklavic
;
Safet Penjic