Parcourir par
Collections
Sources
Geodesic
Parcourir par
Collections
Sources
The electronic journal of combinatorics
Tome 25 (2018)
no. 1
Précédent
Suivant
Tome 25 (2018) no. 1
Sommaire
Graphical Mahonian statistics on words
Amy Grady
;
Svetlana Poznanović
Linear polychromatic colorings of hypercube faces
Evan Chen
On Ehrhart polynomials of lattice triangles
Johannes Hofscheier
;
Benjamin Nill
;
Dennis Öberg
Improved bounds for the Graham-Pollak problem for hypergraphs
Imre Leader
;
Ta Sheng Tan
Bounds on parameters of minimally nonlinear patterns
P. A. CrowdMath
The \(r\)-matching sequencibility of complete graphs
Adam Mammoliti
Equidistributions of Mahonian statistics over pattern avoiding permutations
Nima Amini
On parking functions and the zeta map in types \(B\), \(C\) and \(D\)
Robin Sulzgruber
;
Marko Thiel
The structure of delta-matroids with width one twists
Carolyn Chun
;
Rhiannon Hall
;
Criel Merino
;
Iain Moffatt
;
Steven D Noble
\((q,t)\)-characters of Kirillov-Reshetikhin modules of type \(A_r\) as quantum cluster variables
Bolor Turmunkh
Undesired parking spaces and contractible pieces of the noncrossing partition link
Michael Dougherty
;
Jon McCammond
Some new groups which are not CI-groups with respect to graphs
Ted Dobson
Nonexistence of certain singly even self-dual codes with minimal shadow
Stefka Bouyuklieva
;
Masaaki Harada
;
Akihiro Munemasa
The cycle polynomial of a permutation group
Peter J. Cameron
;
Jason Semeraro
Two-vertex generators of Jacobians of graphs
David Brandfonbrener
;
Pat Devlin
;
Netanel Friedenberg
;
Yuxuan Ke
;
Steffen Marcus
;
Henry Reichard
;
Ethan Sciamma
A large set of torus obstructions and how they were discovered
Wendy Myrvold
;
Jennifer Woodcock
Full Text
Kirillov's unimodality conjecture for the rectangular Narayana polynomials
Herman Z. Q. Chen
;
Arthur L. B. Yang
;
Philip B. Zhang
Toggling independent sets of a path graph
Michael Joseph
;
Tom Roby
Chip-firing on trees of loops
Sameer Kailasa
;
Vivian Kuperberg
;
Nicholas Wawrykow
Zero sum partition of abelian groups into sets of the same order and its applications
Sylwia Cichacz
A rational Catalan formula for \((m,3)\)-Hikita polynomials
Ryan Kaliszewski
;
Debdut Karmakar
A flag Whitney number formula for matroid Kazhdan-Lusztig polynomials
Max Wakefield
Parabolic double cosets in Coxeter groups
Sara C. Billey
;
Matjaž Konvalinka
;
T. Kyle Petersen
;
William Slofstra
;
Bridget E. Tenner
Generalized non-crossing partitions and buildings
Julia Heller
;
Petra Schwer
Likelihood orders for the \(p\)-cycle walks on the symmetric group
Megan Bernstein
The \(Z\)-polynomial of a matroid
Nicholas Proudfoot
;
Yuan Xu
;
Ben Young
Fully packed loop configurations: polynomiality and nested arches
Florian Aigner
A refined count of Coxeter element reflection factorizations
Elise delMas
;
Thomas Hameister
;
Victor Reiner
An arithmetic property of moments of the \(\beta\)-Hermite ensemble and certain map enumerators
Amol Aggarwal
Cubic graphs and related triangulations on orientable surfaces
Wenjie Fang
;
Mihyun Kang
;
Michael Moßhammer
;
Philipp Sprüssel
Context-free grammars for several polynomials associated with Eulerian polynomials
Shi-Mei Ma
;
Jun Ma
;
Yeong-Nan Yeh
;
Bao-Xuan Zhu
Lecture Hall partitions and the affine hyperoctahedral group
Christopher R. H. Hanusa
;
Carla D. Savage
Fixed points of the evacuation of maximal chains on fuss shapes
Sen-Peng Eu
;
Tung-Shan Fu
;
Hsiang-Chun Hsu
;
Yu-Pei Huang
Symmetries of unlabelled planar triangulations
Mihyun Kang
;
Philipp Sprüssel
Burling graphs, chromatic number, and orthogonal tree-decompositions
Stefan Felsner
;
Gwenaël Joret
;
Piotr Micek
;
William T. Trotter
;
Veit Wiechert
Conserved quantities of Q-systems from dimer integrable systems
Panupong Vichitkunakorn
\(q\)-Stirling identities revisited
Yue Cai
;
Richard Ehrenborg
;
Margaret Readdy
Almost tiling of the Boolean lattice with copies of a poset
István Tomon
Non-classical hyperplanes of finite thick dual polar spaces
Bart De Bruyn
The existence of a path-factor without small odd paths
Yoshimi Egawa
;
Michitaka Furuya
Obstructions to combinatorial formulas for plethysm
Thomas Kahle
;
Mateusz Michałek
The Cayley isomorphism property for Cayley maps
Mikhail Muzychuk
;
Gábor Somlai
The orthomorphism graph \(\mathcal{L}_3(q)\)
Anthony B. Evans
Operads of finite posets
Frédéric Fauvet
;
Loïc Foissy
;
Dominique Manchon
Partitioning sparse graphs into an independent set and a forest of bounded degree
François Dross
;
Mickael Montassier
;
Alexandre Pinlou
On the stability of independence polynomials
Jason I. Brown
;
Ben Cameron
Coloring cross-intersecting families
Danila Cherkashin
Eulerian numbers associated with arithmetical progressions
José L. Ramírez
;
Sergio N. Villamarin
;
Diego Villamizar
On the minimum size of an identifying code over all orientations of a graph
Nathann Cohen
;
Frédéric Havet
A Brooks type theorem for the maximum local edge connectivity
Michael Stiebitz
;
Bjarne Toft
A better lower bound on average degree of online \(k\)-list-critical graphs
Landon Rabern
On bipartite \(Q\)-polynomial distance-regular graphs with diameter 9, 10, or 11
Štefko Miklavič
Upper bound on the circular chromatic number of the plane
Konstanty Junosza-Szaniawski
A classification of Motzkin numbers modulo 8
Ying Wang
;
Guoce Xin
On almost-planar graphs
Guoli Ding
;
Joshua Fallon
;
Emily Marshall
Extremal numbers for directed hypergraphs with two edges
Alex Cameron
Core partitions with distinct parts
Huan Xiong
A combinatorial proof of a formula of Biane and Chapuy
Sinho Chewi
;
Venkat Anantharam
Equivalence of edge bicolored graphs on surfaces
Oliver T. Dasbach
;
Heather M. Russell
On the diameter of dual graphs of Stanley-Reisner rings and Hirsch type bounds on abstractions of polytopes
Brent Holmes
On repetition thresholds of caterpillars and trees of bounded degree
Borut Lužar
;
Pascal Ochem
;
Alexandre Pinlou
Induced 2-degenerate subgraphs of triangle-free planar graphs
Zdeněk Dvořák
;
Tom Kelly
On the extremal Betti numbers of binomial edge ideals of block graphs
Jürgen Herzog
;
Giancarlo Rinaldo
Periods of Ehrhart coefficients of rational polytopes
Tyrrell B. McAllister
;
Hélène O. Rochais
Connected order ideals and \(P\)-partitions
Ben P. Zhou
Extensions of partial cyclic orders, Euler numbers and multidimensional boustrophedons
Sanjay Ramassamy
Covering a graph with cycles of length at least 4
Hong Wang
Rook placements and Jordan forms of upper-triangular nilpotent matrices
Martha Yip
Symmetric chain decompositions of products of posets with long chains
Stefan David
;
Hunter Spink
;
Marius Tiba
Piercing axis-parallel boxes
Maria Chudnovsky
;
Sophie Spirkl
;
Shira Zerbib
A characterization of Hermitian varieties as codewords
Angela Aguglia
;
Daniele Bartoli
;
Leo Storme
;
Zsuzsa Weiner
Constraining the clustering transition for colorings of sparse random graphs
Michael Anastos
;
Alan Frieze
;
Wesley Pegden
Finding balance: split graphs and related classes
Karen L. Collins
;
Ann N. Trenk
Every plane graph is facially-non-repetitively \(C\)-choosable
Grzegorz Gutowski