Parcourir par
Collections
Sources
Geodesic
Parcourir par
Collections
Sources
The electronic journal of combinatorics
Tome 29 (2022)
no. 2
Précédent
Suivant
Tome 29 (2022) no. 2
Sommaire
Spectral radius, edge-disjoint cycles and cycles of the same length
Huiqiu Lin
;
Mingqing Zhai
;
Yanhua Zhao
Bell numbers in Matsunaga's and Arima's Genjikō combinatorics: modern perspectives and local limit theorems
Xiaoling Dou
;
Hsien-Kuei Hwang
;
Chong-Yi Li
There does not exist a strongly regular graph with parameters \((1911, 270, 105, 27)\)
Jack Koolen
;
Brhane Gebremichel
A \(q\)-multisum identity arising from finite chain ring probabilities
Jehanne Dousse
;
Robert Osburn
On the maximum of the weighted binomial sum \(2^{-r}\sum_{i=0}^r\binom{m}{i}\)
Stephen Glasby
;
Gerhard Paseman
Flip graphs of stacked and flag triangulations of the 2-sphere
Benjamin Burton
;
Basudeb Datta
;
Jonathan Spreer
The fractional chromatic number of generalized cones over graphs
Jialu Zhu
;
Xuding Zhu
An equivariant quantum Pieri rule for the Grassmannian on cylindric shapes
Anna Bertiger
;
Dorian Ehrlich
;
Elizabeth Milićević
;
Kaisa Taipale
Eigenvalues of Cayley graphs
Xiaogang Liu
;
Sanming Zhou
Diagonal hooks and a Schmidt-type partition identity
Shane Chern
;
Ae Ja Yee
Combinatorial perspectives on the crank and mex partition statistics
Brian Hopkins
;
James Sellers
;
Ae Ja Yee
On bipartite distance-regular Cayley graphs with small diameter
Edwin R. van Dam
;
Mojtaba Jazaeri
An area-depth symmetric \(q, t\)-Catalan polynomial
Joseph Pappe
;
Digjoy Paul
;
Anne Schilling
On a huge family of non-Schurian Schur rings
Akihide Hanaki
;
Takuto Hirai
;
Ilia Ponomarenko
Gamma-positivity for a refinement of median Genocchi numbers
Sen-Peng Eu
;
Tung-Shan Fu
;
Hsin-Hao Lai
;
Yuan-Hsun Lo
Hadamard diagonalizable graphs of order at most 36
Jane Breen
;
Steve Butler
;
Melissa Fuentes
;
Bernard Lidický
;
Michael Phillips
;
Alexander Riasanovksy
;
Sung-Yell Song
;
Ralihe Villagrán
;
Cedar Wiseman
;
Xiaohong Zhang
Chordal directed graphs are not \(\chi\)-bounded
Pierre Aboulker
;
Nicolas Bousquet
;
Rémi de Verclos
On sum sets and convex functions
Sophie Stevens
;
Audie Warren
Positivity of chromatic symmetric functions associated with Hessenberg functions of bounce number 3
Soojin Cho
;
Jaehyun Hong
On the subspace choosability in graphs
Dror Chawin
;
Ishay Haviv
Forbidden induced pairs for perfectness and \(\omega\)-colourability of graphs
Maria Chudnovsky
;
Adam Kabela
;
Binlong Li
;
Petr Vrána
Covering symmetric sets of the Boolean cube by affine hyperplanes
S. Venkitesh
Degrees in link graphs of regular graphs
Itai Benjamini
;
John Haslegrave
Some combinatorial properties of skew Jack symmetric functions
Paolo Bravi
;
Jacopo Gandini
Size and structure of large \((s,t)\)-union intersecting families
Ali Taherkhani
Trees contained in every orientation of a graph
Tássio Naia
Weakly linked embeddings of pairs of complete graphs in \(\mathbb{R}^3\)
James Di
;
Erica Flapan
;
Spencer Johnson
;
Daniel Thompson
;
Christopher Tuffley
Integer colorings with no rainbow 3-term arithmetic progression
Xihe Li
;
Hajo Broersma
;
Ligong Wang
Rowmotion orbits of trapezoid posets
Quang Vu Dao
;
Julian Wellman
;
Calvin Yost-Wolff
;
Sylvester W. Zhang
Central limit theorem for the largest component of random intersection graph
Liang Dong
;
Zhishui Hu
Moduli spaces of codimension-one subspaces in a linear variety and their tropicalization
Philipp Jell
;
Hannah Markwig
;
Felipe Rincón
;
Benjamin Schröter
On maximal sum-free sets in abelian groups
Nathanaël Hassler
;
Andrew Treglown
Tree/endofunction bijections and concentration inequalities
Steven Heilman
Note on the number of balanced independent sets in the Hamming cube
Jinyoung Park
Turán number of disjoint triangles in 4-partite graphs
Jie Han
;
Yi Zhao
Minimum maximal matchings in cubic graphs
Wouter Cames van Batenburg
Simplicial dollar game
Jesse Kim
;
David Perkinson
The excluded minors for lattice path polymatroids
Joseph Bonin
;
Carolyn Chun
;
Tara Fife
A note on Möbius functions of upho posets
Sam Hopkins
Spectra of weighted uniform hypertrees
Jiang-Chao Wan
;
Yi Wang
;
Fu-Tao Hu
An extension of the Lindström-Gessel-Viennot theorem
Yi-Lin Lee
Shattering and more: Extending the complete object
R. P. Anstee
;
N. A. Nikov
Acyclic, star, and injective colouring: bounding the diameter
Christoph Brause
;
Petr Golovach
;
Barnaby Martin
;
Pascal Ochem
;
Daniël Paulusma
;
Siani Smith
Generalized rainbow Turán problems
Dániel Gerbner
;
Tamás Mészáros
;
Abhishek Methuku
;
Cory Palmer
On polynomials counting essentially irreducible maps
Timothy Budd
Reduced word enumeration, complexity, and randomization
Cara Monical
;
Benjamin Pankow
;
Alexander Yong
Concatenating bipartite graphs
Maria Chudnovsky
;
Patrick Hompe
;
Alex Scott
;
Paul Seymour
;
Sophie Spirkl
On the trivial \(T\)-module of a graph
Blas Fernández
;
Štefko Miklavič
A categorification for the signed chromatic polynomial
Zhiyun Cheng
;
Ziyi Lei
;
Yitian Wang
;
Yanguo Zhang
Queen domination of even square boards
William D. Weakley
An improved planar graph product structure theorem
Torsten Ueckerdt
;
David Wood
;
Wendy Yi
Factorially many maximum matchings close to the Erdős-Gallai bound
Stéphane Bessy
;
Johannes Pardey
;
Lucas Picasarri-Arrieta
;
Dieter Rautenbach
The number of \(k\)-dimensional corner-free subsets of grids
Younjin Kim
Dense Eulerian graphs are \((1, 3)\)-choosable
Huajing Lu
;
Xuding Zhu
On nilpotent orientably-regular maps of nilpotency class \(4\)
Wenqin Xu
;
Shaofei Du
;
Jin Ho Kwak
;
Jian Lei
;
Kaina Shi
Extremal graphs for a spectral inequality on edge-disjoint spanning trees
Sebastian M. Cioabă
;
Anthony Ostuni
;
Davin Park
;
Sriya Potluri
;
Tanay Wakhare
;
Wiseley Wong
Completely regular codes in Johnson and Grassmann graphs with small covering radii
Ivan Mogilnykh
Guessing numbers and extremal graph theory
Jo Martin
;
Puck Rombach