Parcourir par
Collections
Sources
Geodesic
Parcourir par
Collections
Sources
The electronic journal of combinatorics
Tome 21 (2014)
no. 2
Précédent
Suivant
Tome 21 (2014) no. 2
Sommaire
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