Parcourir par
Collections
Sources
Geodesic
Parcourir par
Collections
Sources
The electronic journal of combinatorics
Tome 30 (2023)
no. 2
Précédent
Suivant
Tome 30 (2023) no. 2
Sommaire
Proof of a conjecture involving derangements and roots of unity
Han Wang
;
Zhi-Wei Sun
Enumeration of perfect matchings of the Cartesian products of graphs
Wei Li
;
Yao Wang
Bounds on half graph orders in powers of sparse graphs
Marek Sokołowski
Perfect colorings of the infinite square grid: coverings and twin colors
Denis Krotov
Betwixt and between 2-factor Hamiltonian and perfect-matching-Hamiltonian graphs
Federico Romaniello
;
Jean Paul Zerafa
The \(h\)-polynomial and the rook polynomial of some polyominoes
Manoj Kummini
;
Dharm Veer
A new feasibility condition for the AT4 family
Zheng-Jiang Xia
;
Jae-Ho Lee
;
Jack H. Koolen
Combinatorial derived matroids
Ragnar Freij-Hollanti
;
Relinde Jurrius
;
Olga Kuznetsova
On the \(q\)-analogue of Pólya's theorem
Alin Bostan
;
Sergey Yurkevich
Tight bound for the number of distinct palindromes in a tree
Paweł Gawrychowski
;
Tomasz Kociumaka
;
Wojciech Rytter
;
Tomasz Waleń
Some arithmetic properties of Pólya's urn
José L. Fernández
;
Pablo Fernández
A splitter theorem for elastic elements in 3-connected matroids
George Drummond
;
Charles Semple
Impartial hypergraph games
Nándor Sieben
Spectral radius conditions for the rigidity of graphs
Dandan Fan
;
Xueyi Huang
;
Huiqiu Lin
On enumeration and entropy of ribbon tilings
Yinsong Chen
;
Vladislav Kargin
On the generating function for intervals in Young's lattice
Faqruddin Ali Azam
;
Edward Richmond
Enumeration of corner polyhedra and 3-connected Schnyder labelings
Éric Fusy
;
Erkan Narmanli
;
Gilles Schaeffer
Ore- and Pósa-type conditions for partitioning 2-edge-coloured graphs into monochromatic cycles
Patrick Arras
Zero-sum squares in \(\{-1, 1\}\)-matrices with low discrepancy
Tom Johnston
Infinite families of hypertopes from centrally symmetric polytopes
Claudio Alexandre Piedade
A note on long cycles in sparse random graphs
Michael Anastos
Mixed dimer configuration model in type D cluster algebras
Gregg Musiker
;
Kayla Wright
On the spectral radius of minimally 2-(edge)-connected graphs with given size
Zhenzhen Lou
;
Gao Min
;
Qiongxiang Huang
Estimating global subgraph counts by sampling
Svante Janson
;
Valentas Kurauskas
The Park-Pham theorem with optimal convergence rate
Tolson Bell
A Cantor-Bendixson rank for siblings of trees
Davoud Abdi
The number of occurrences of patterns in a random tree or forest permutation
Svante Janson
The complexity of the matroid homomorphism problem
Cheolwon Heo
;
Hyobin Kim
;
Siggers Mark
Combinatorial constructions of generating functions of cylindric partitions with small profiles into unrestricted or distinct parts
Kağan Kurşungöz
;
Halime Ömrüuzun Seyrek
Generating \(I\)-eigenvalue free threshold graphs
Luiz Emilio Allem
;
Elismar R. Oliveira
;
Fernando Tura
Behaviour of the normalized depth function
Antonino Ficarra
;
Jürgen Herzog
;
Takayuki Hibi
Characterizing planar tanglegram layouts and applications to edge insertion problems
Kevin Liu
Generalized Riemann functions, their weights, and the complete graph
Nicolas Folinsbee
;
Joel Friedman
Edge and pair queries-random graphs and complexity
Dariusz Dereniowski
;
Przemysław Gordinowicz
;
Paweł Prałat
Turán numbers and anti-Ramsey numbers for short cycles in complete \(3\)-partite graphs
Chunqiu Fang
;
Ervin Győri
;
Chuanqi Xiao
;
Jimeng Xiao
Generalized Alder-type partition inequalities
Liam Armstrong
;
Bryan Ducasse
;
Thomas Meyer
;
Holly Swisher
Induced subgraphs and path decompositions
Robert Hickingbotham
Rooted prism-minors and disjoint cycles containing a specified edge
J.P. Costalonga
;
T.J. Reid
;
H. Wu
An algebraic formulation of hypergraph colorings
Michael Krul
;
Luboš Thoma
On the minimum bisection of random 3-regular graphs
Lyuben Lichev
;
Dieter Mitsche
Cyclic descents, matchings and Schur-positivity
Ron M Adin
;
Yuval Roichman
Induced subgraphs and tree decompositions. IV: (Even hole, diamond, pyramid)-free graphs
Tara Abrishami
;
Maria Chudnovsky
;
Sepehr Hajebi
;
Sophie Spirkl
Maximal degree subposets of \(\nu\)-Tamari lattices
Aram Dermenjian
The \(h^\ast\)-polynomial of the order polytope of the zig-zag poset
Jane Ivy Coons
;
Seth Sullivant
Perfect matching complexes of honeycomb graphs
Margaret Bayer
;
Marija Jelić Milutinović
;
Julianne Vega
On the running time of hypergraph bootstrap percolation
Jonathan A. Noel
;
Arjun Ranganathan
On counting double centralizers of symmetric groups
Zhipeng Lu
Towards \(3n-4\) in groups of prime order
Vsevolod F. Lev
;
Oriol Serra
Hadamard matrices related to projective planes
Hadi Kharaghani
;
Sho Suda
Solutions to seven and a half problems on tilings
Bojan Bašić
;
Aleksa Džuklevski
;
Anna Slivková
Random cubic planar maps
Michael Drmota
;
Marc Noy
;
Clément Requilé
;
Juanjo Rué
Cyclic products and optimal traps in cyclic birth and death chains
Mark Holmes
;
Alexander E. Holroyd
;
Alejandro Ramírez
How many cliques can a clique cover cover?
Pavel Shuldiner
;
R. Wayne Oldford
Monk's rule for Demazure characters of the general linear group
Sami Assaf
;
Danjoseph Quijada
A tropical count of real bitangents to plane quartic curves
Alheydis Geiger
;
Marta Panizzut
On the chromatic number in the stochastic block model
Mikhail Isaev
;
Mihyun Kang
Numerical semigroups, polyhedra, and posets. III: Minimal presentations and face dimension
Tara Gomes
;
Christopher O'Neill
;
Eduardo Torres Davila