Parcourir par
Collections
Sources
Geodesic
Parcourir par
Collections
Sources
The electronic journal of combinatorics
Tome 23 (2016)
no. 1
Précédent
Suivant
Tome 23 (2016) no. 1
Sommaire
Bi-Cohen-Macaulay graphs
Jürgen Herzog
;
Ahad Rahimi
On periodicity of generalized pseudostandard words
Josef Florian
;
L'ubomíra Dvořáková
Posets of finite functions
Konrad Pióro
Simultaneous core partitions: parameterizations and sums
Victor Y. Wang
An extension of MacMahon's equidistribution theorem to ordered multiset partitions
Andrew Timothy Wilson
Low degree Nullstellensatz certificates for 3-colorability
Bo Li
;
Benjamin Lowenstein
;
Mohamed Omar
Expansions of a chord diagram and alternating permutations
Tomoki Nakamigawa
Combinatorial proofs of addition formulas
Xiang-Ke Chang
;
Xing-Biao Hu
;
Hongchuan Lei
;
Yeong-Nan Yeh
Sphere representations, stacked polytopes, and the Colin de Verdière number of a graph
Lon Mitchell
;
Lynne Yengulalp
Finite edge-transitive oriented graphs of valency four: a global approach
Jehan A. Al-bar
;
Ahmad N. Al-kenani
;
Najat M. Muthana
;
Cheryl E. Praeger
;
Pablo Spiga
A quantitative study of pure parallel processes
O. Bodini
;
A. Genitrini
;
F. Peschanski
The phase transition in site percolation on pseudo-random graphs
Michael Krivelevich
A combinatorial proof of a relationship between maximal \((2k-1,2k+1)\)-cores and \((2k-1,2k,2k+1)\)-cores
Rishi Nath
;
James A. Sellers
The chromatic number of a signed graph
Edita Máčajová
;
André Raspaud
;
Martin Škoviera
Chromatic bases for symmetric functions
Soojin Cho
;
Stephanie van Willigenburg
A note on perfect matchings in uniform hypergraphs
Andrew Treglown
;
Yi Zhao
A note on maxima in random walks
Joseph Helfer
;
Daniel T. Wise
Avoiding letter patterns in ternary square-free words
Elena A. Petrova
Doubled patterns are 3-avoidable
Pascal Ochem
A note on the \(\gamma\)-coefficients of the tree Eulerian polynomial
Rafael S. González D'León
Another proof of the Harer-Zagier formula
Boris Pittel
A new lower bound for the Towers of Hanoi problem
Codruƫ Grosu
An orthogonal basis for functions over a slice of the Boolean hypercube
Yuval Filmus
Generalizing the classic greedy and necklace constructions of de Bruijn sequences and universal cycles
Joe Sawada
;
Aaron Williams
;
Dennis Wong
Closed, palindromic, rich, privileged, trapezoidal, and balanced words in automatic sequences
Luke Schaeffer
;
Jeffrey Shallit
Determining a binary matroid from its small circuits
James Oxley
;
Charles Semple
;
Geoff Whittle
A curved Brunn-Minkowski inequality for the symmetric group
Weerachai Neeranartvong
;
Jonathan Novak
;
Nat Sothanaphan
The peeling process of infinite Boltzmann planar maps
Timothy Budd
On cylindrical graph construction and its applications
Amir Daneshgar
;
Mohsen Hejrati
;
Meysam Madani
Restricted frame graphs and a conjecture of Scott
Jérémie Chalopin
;
Louis Esperet
;
Zhentao Li
;
Patrice Ossona de Mendez
On computation of Baker and Norine's rank on complete graphs
Robert Cori
;
Yvan Le Borgne
The nonexistence of a distance-regular graph with intersection array \(\{22,16,5;1,2,20\}\)
Supalak Sumalroj
;
Chalermpong Worawannotai
Iterative properties of birational rowmotion. I: Generalities and skeletal posets.
Darij Grinberg
;
Tom Roby
Generalised polygons admitting a point-primitive almost simple group of Suzuki or Ree type
Luke Morgan
;
Tomasz Popiel
Two descent statistics over \(321\)-avoiding centrosymmetric involutions
Marilena Barnabei
;
Flavio Bonetti
;
Sergi Elizalde
;
Matteo Silimbani
Avoidability index for binary patterns with reversal
James Currie
;
Philip Lafrance
Subspaces intersecting each element of a regulus in one point, André-Bruck-Bose representation and clubs
Michel Lavrauw
;
Corrado Zanella
New Eulerian numbers of type \(D\)
Anna Borowiec
;
Wojciech Młotkowski
Cayley graphs with an infinite Heesch number
Azer Akhmedov
\(K\)-Knuth equivalence for increasing tableaux
Christian Gaetz
;
Michelle Mastrianni
;
Rebecca Patrias
;
Hailee Peck
;
Colleen Robichaux
;
David Schwein
;
Ka Yu Tam
On the resistance matrix of a graph
Jiang Zhou
;
Zhongyu Wang
;
Changjiang Bu
Average degree conditions forcing a minor
Daniel J. Harvey
;
David R. Wood
Inversions of semistandard Young tableaux
Paul Drube
Enumeration of parallelograms in permutation matrices for improved bounds on the density of Costas arrays
Christopher N. Swanson
;
Bill Correll, Jr.
;
Randy W. Ho
Web matrices: structural properties and generating combinatorial identities
Mark Dukes
;
Chris D White
Spectrally extremal vertices, strong cospectrality, and state transfer
Gabriel Coutinho
Polynomials defined by tableaux and linear recurrences
Per Alexandersson
Guessing games on triangle-free graphs
Peter J. Cameron
;
Anh N. Dang
;
Søren Riis
Extending cycles locally to Hamilton cycles
Matthias Hamann
;
Florian Lehner
;
Julian Pott
Correlation among runners and some results on the lonely runner conjecture
Guillem Perarnau
;
Oriol Serra
Growth rates of groups associated with face 2-coloured triangulations and directed Eulerian digraphs on the sphere
Thomas A. McCourt
On Erdős-Sós conjecture for trees of large size
Agnieszka Goerlich
;
Andrzej Żak
On the matchings-Jack conjecture for Jack connection coefficients indexed by two single part partitions
Andrei L. Kanunnikov
;
Ekaterina A. Vassilieva
Graphs with induced-saturation number zero
Sarah Behrens
;
Catherine Erbes
;
Michael Santana
;
Derrek Yager
;
Elyse Yeager
Flag statistics from the Ehrhart \(h^\ast\)-polynomial of multi-hypersimplices
Guo-Niu Han
;
Matthieu Josuat-Vergès
A class of infinite convex geometries
Kira Adaricheva
;
J. B. Nation
Chip-firing game and a partial Tutte polynomial for Eulerian digraphs
Kévin Perrot
;
Trung Van Pham
Local probabilities for random permutations without long cycles
Eugenijus Manstavičius
;
Robertas Petuchovas
New duality operator for complex circulant matrices and a conjecture of Ryser
Luis H. Gallardo
The degree/diameter problem in maximal planar bipartite graphs
Cristina Dalfó
;
Clemens Huemer
;
Julián Salas