Parcourir par
Collections
Sources
Geodesic
Parcourir par
Collections
Sources
The electronic journal of combinatorics
Tome 25 (2018)
no. 4
Précédent
Suivant
Tome 25 (2018) no. 4
Sommaire
Generating asymptotics for factorially divergent sequences
Michael Borinsky
Reflexive graphs with near unanimity but no semilattice polymorphisms
Mark Siggers
On robust colorings of Hamming-distance graphs
Isaiah Harney
;
Heide Gluesing-Luerssen
Cohomology classes of interval positroid varieties and a conjecture of Liu
Brendan Pawlowski
Random planar maps and graphs with minimum degree two and three
Marc Noy
;
Lander Ramos
Polynomiality of certain average weights for oscillating tableaux
Guo-Niu Han
;
Huan Xiong
Counting proper colourings in 4-regular graphs via the Potts model
Ewan Davies
Planar transitive graphs
Matthias Hamann
Coboundary categories and local rules
Bruce W. Westbury
The largest pure partial planes of order 6 have size 25
Yibo Gao
Constant terms of near-Dyson polynomials
Alexey Gordeev
Linear dependence between hereditary quasirandomness conditions
Xiaoyu He
The matching polynomials and spectral radii of uniform supertrees
Li Su
;
Liying Kang
;
Honghai Li
;
Erfang Shan
A new perspective on the average mixing matrix
Gabriel Coutinho
;
Chris Godsil
;
Krystal Guo
;
Hanmeng Zhan
On the clique number of a strongly regular graph
Gary R. W. Greaves
;
Leonard H. Soicher
Flip posets of Bruhat intervals
Saúl A. Blanco
Shuffle-compatible permutation statistics. II: The exterior peak set
Darij Grinberg
On the diameter of tree associahedra
Jean Cardinal
;
Stefan Langerman
;
Pablo Pérez-Lantero
Unique rectification in \(d\)-complete posets: towards the \(K\)-theory of Kac-Moody flag varieties
Rahul Ilango
;
Oliver Pechenik
;
Michael Zlatin
On the Schur positivity of \(\Delta_{e_{2}} e_n[X]\)
Qiu Dun
;
Jeffrey B. Remmel
;
Emily Sergel
;
Guoce Xin
Using symbolic computation to prove nonexistence of distance-regular graphs
Janoš Vidali
Infinite graphical Frobenius representations
Mark E. Watkins
Bounds for matchings in nonabelian groups
Will Sawin
Analogies between the crossing number and the tangle crossing number
Robin Anderson
;
Shuliang Bai
;
Fidel Barrera-Cruz
;
Éva Czabarka
;
Giordano Da Lozzo
;
Natalie L. F. Hobson
;
Jephian C.-H. Lin
;
Austin Mohr
;
Heather C. Smith
;
László A. Székely
;
Hays Whitlatch
\(\lambda\)-Euler's difference table for colored permutations
Bin Han
Counting partitions of a fixed genus
Robert Cori
;
Gábor Hetyei
On upper transversals in 3-uniform hypergraphs
Michael A. Henning
;
Anders Yeo
Inverse Perron values and connectivity of a uniform hypergraph
Changjiang Bu
;
Haifeng Li
;
Jiang Zhou
Density of monochromatic infinite paths
Allan Lo
;
Nicolás Sanhueza-Matamala
;
Guanghui Wang
Transversals, plexes, and multiplexes in iterated quasigroups
Anna Taranenko
An algebra associated with a flag in a subspace lattice over a finite field and the quantum affine algebra
Yuta Watanabe
On the union complexity of families of axis-parallel rectangles with a low packing number
Chaya Keller
;
Shakhar Smorodinsky
Path choosability of planar graphs
Glenn G. Chappell
;
Chris Hartman
On the number of connected sets in bounded degree graphs
Kustaa Kangas
;
Petteri Kaski
;
Janne H. Korhonen
;
Mikko Koivisto
Uniquely \(K_r^{(k)}\)-saturated hypergraphs
András Gyárfás
;
Stephen G. Hartke
;
Charles Viss
Hamilton \(\ell\)-cycles in randomly perturbed hypergraphs
Andrew McDowell
;
Richard Mycroft
Random numerical semigroups and a simplicial complex of irreducible semigroups
Jesus De Loera
;
Christopher O'Neill
;
Dane Wilburne
A Sauer-Shelah-Perles lemma for sumsets
Zeev Dvir
;
Shay Moran
Degenerate Turán problems for hereditary properties
Vladimir Nikiforov
;
Michael Tait
;
Craig Timmons
A new lower bound for the size of an affine blocking set
Maarten De Boeck
;
Geertrui Van de Voorde
\((k,\lambda)\)-anti-powers and other patterns in words
Amanda Burcroff
Cyclic sieving, necklaces, and branching rules related to Thrall's problem
Connor Ahlbach
;
Joshua P. Swanson
A family of partially ordered sets with small balance constant
Evan Chen
Combinatorial interpretations of the Kreweras triangle in terms of subset tuples
Ange Bigeni
Graph families with constant distance determinant
Yen-Jen Cheng
;
Jephian C.-H. Lin
Coloring chains for compression with uncertain priors
Noah Golowich
Enumerations, forbidden subgraph characterizations, and the split-decomposition
Maryam Bahrani
;
Jérémie Lumbroso
Independent sets in the union of two Hamiltonian cycles
Ron Aharoni
;
Daniel Soltész
Bandwidth of graphs resulting from the edge clique covering problem
Konrad Engel
;
Sebastian Hanisch
Distribution of coefficients of rank polynomials for random sparse graphs
Dmitry Jakobson
;
Calum MacRury
;
Sergey Norin
;
Lise Turner
Boxicity, poset dimension, and excluded minors
Louis Esperet
;
Veit Wiechert
Random Kneser graphs and hypergraphs
Andrey Kupavskii
Theta-vexillary signed permutations
Jordan Lambert
Measures of edge-uncolorability of cubic graphs
M. A. Fiol
;
G. Mazzuoccolo
;
E. Steffen
Minimal obstructions for partial representations of interval graphs
Pavel Klavik
;
Maria Saumell
Clique colourings of geometric graphs
Colin McDiarmid
;
Dieter Mitsche
;
Pawel Prałat
On certain combinatorial expansions of the Legendre-Stirling numbers
Shi-Mei Ma
;
Jun Ma
;
Yeong-Nan Yeh
Lozenge tilings of a halved hexagon with an array of triangles removed from the boundary. II
Tri Lai
Hypergraph coverings and their zeta functions
Deqiong Li
;
Yaoping Hou
Spectral and combinatorial properties of some algebraically defined graphs
Sebastian M. Cioabă
;
Felix Lazebnik
;
Shuying Sun
Ramsey-Turán numbers for semi-algebraic graphs
Jacob Fox
;
János Pach
;
Andrew Suk
Centroidal localization game
Bartłomiej Bosek
;
Przemysław Gordinowicz
;
Jarosław Grytczuk
;
Nicolas Nisse
;
Joanna Sokół
;
Małgorzata Śleszyńska-Nowak
Signed cycle double covers
Lingsheng Shi
;
Zhang Zhang
A two-sided analogue of the Coxeter complex
T. Kyle Petersen
Partial characterization of graphs having a single large Laplacian eigenvalue
L. Emilio Allem
;
Antonio Cafure
;
Ezequiel Dratman
;
Luciano N. Grippo
;
Martín D. Safe
;
Vilmar Trevisan
Minimal multiple blocking sets
Anurag Bishnoi
;
Sam Mattheus
;
Jeroen Schillewaert