Parcourir par
Collections
Sources
Geodesic
Parcourir par
Collections
Sources
The electronic journal of combinatorics
Tome 31 (2024)
no. 1
Précédent
Suivant
Tome 31 (2024) no. 1
Sommaire
Integer decomposition property of polytopes
Sharon Robins
Triangles and subgraph probabilities in random regular graphs
Pu Gao
Convexity, squeezing, and the Elekes-Szabó theorem
Oliver Roche-Newton
;
Elaine Wong
Weakening total coloring conjecture and Hadwiger's conjecture on total graphs
Manu Basavaraju
;
L. Sunil Chandran
;
Mathew Francis
;
Ankur Naskar
Critical groups of arithmetical structures on star graphs and complete graphs
Kassie Archer
;
Alexander Diaz-Lopez
;
Darren Broderick Glass
;
Joel Louwsma
Abelian sandpiles on Sierpiński gasket graphs
Robin Kaiser
;
Ecaterina Sava-Huss
;
Yuwen Wang
A note on Ramsey numbers involving large books
Meng Liu
;
Yusheng Li
Weak Heffter arrays and biembedding graphs on non-orientable surfaces
Simone Costa
;
Lorenzo Mella
;
Anita Pasotti
On extended boundary sequences of morphic and Sturmian words
Michel Rigo
;
Manon Stipulanti
;
Markus Whiteland
Weighted projections of alternating sign matrices: Latin-like squares and the ASM polytope
Cian O'Brien
Power of \(k\) choices in the semi-random graph process
Paweł Prałat
;
Harjas Singh
Topology of complements of skeletons
Rowan Rowlands
A comparison of Integer partitions based on smallest part
Damanvir Singh Binner
;
Amarpreet Rattan
The virtual cactus group and Littelmann paths
Jacinta Torres
Matroid lifts and representability
Daniel Irving Bernstein
;
Zach Walsh
New hereditary and mutation-invariant properties arising from forks
Tucker Ervin
An embedding of the skein action on set partitions into the skein action on matchings
Jesse Kim
Incidences of cubic curves in finite fields
Audie Warren
On some extremal and probabilistic questions for tree posets
Balázs Patkós
;
Andrew Treglown
Generating new partition identities via a generalized continued fraction algorithm
Wael Baalbaki
;
Thomas Garrity
Balanced nontransitive dice: existence and probability
Dohyeon Kim
;
Ringi Kim
;
Wonjun Lee
;
Yuhyeon Lim
;
Yoojin So
Various bounds on the minimum number of arcs in a \(k\)-dicritical digraph
Pierre Aboulker
;
Quentin Vermande
Bijection between trees in Stanley character formula and factorizations of a cycle
Karolina Trokowska
;
Piotr Śniady
An upper bound for the number of rectangulations of a planar point set
Hannah Ashbach
;
Kiki Pichini
Spectral extremal problem on disjoint color-critical graphs
Xingyu Lei
;
Shuchao Li
Spanning tree bounds for grid graphs
Kristopher Tapp
Hurwitz orbits on reflection factorizations of parabolic quasi-Coxeter elements
Theo Douvropoulos
;
Joel Brewster Lewis
Extremal results for graphs avoiding a rainbow subgraph
Zhen He
;
Peter Frankl
;
Ervin Győri
;
Zequn Lv
;
Nika Salia
;
Casey Tompkins
;
Kitti Varga
;
Xiutao Zhu
Generalized splines on graphs with two labels and polynomial splines on cycles
Portia Anderson
;
Jacob P. Matherne
;
Julianna Tymoczko
Binding number, \(k\)-factor and spectral radius of graphs
Dandan Fan
;
Huiqiu Lin
Nordhaus-Gaddum type inequalities for the \(k\)th largest Laplacian eigenvalues
Wen-Jun Li
;
Ji-Ming Guo
A nearly finitary matroid that is not \(k\)-nearly finitary
Patrick Tam
Piercing all translates of a set of axis-parallel rectangles
Adrian Dumitrescu
;
Josef Tkadlec
Alon-Boppana-type bounds for weighted graphs
Alexander Polyanskii
;
Rynat Sadykov
A strengthening and an efficient implementation of Alon-Tarsi list coloring method
Zdeněk Dvořák
Some identities involving \(q\)-Stirling numbers of the second kind in type B
Mingjian Ding
;
Jiang Zeng
Wreath products and projective system of non-Schurian association schemes
Makoto Matsumoto
;
Kento Ogawa
The critical groups of Adinkras up to 2-rank of Cayley graphs
Chi Ho Yuen
Hamiltonian intervals in the lattice of binary paths
I. Tasoulas
;
K. Manes
;
A. Sapounakis
Degree factors with red-blue coloring of regular graphs
Michitaka Furuya
;
Mikio Kano
Wiener indices of minuscule lattices
Colin Defant
;
Valentin Féray
;
Philippe Nadeau
;
Nathan Williams
A discrete variation of the Littlewood-Offord problem
Hossein Esmailian
;
Ebrahim Ghorbani
Sharp degree bounds for fake weighted projective spaces
Andreas Bäuerle
On the concentration of the chromatic number of random graphs
Erlang Surya
;
Lutz Warnke
Graphs with girth \(2\ell+1\) and without longer odd holes that contain an odd \(K_4\)-subdivision
Rong Chen
;
Yidong Zhou
Logarithms of Catalan generating functions: a combinatorial approach
Sabine Jansen
;
Leonid Kolesnikov
Cores of partitions in rectangles
Arvind Ayyer
;
Shubham Sinha
Demazure product of permutations and hopping
Tina Li
;
Suho Oh
;
Edward Richmond
;
Grace Yan
;
Kimberly You
The zonotopal algebra of the broken wheel graph and its generalization
Sarah B. Brodsky
Hadamard matrices of orders 60 and 64 with automorphisms of orders 29 and 31
Araya Makoto
;
Masaaki Harada
;
Tonchev Vladimir
Bidding combinatorial games
Prem Kant
;
Urban Larsson
;
Ravi K. Rai
;
Akshay V. Upasany
A spectral extremal problem on non-bipartite triangle-free graphs
Yongtao Li
;
Lihua Feng
;
Yuejian Peng
Enumeration of sets of mutually orthogonal Latin rectangles
Gerold Jäger
;
Klas Markström
;
Lars-Daniel Öhman
;
Denys Shcherbak
Cobiased graphs: single-element extensions and elementary quotients of graphic matroids
Daniel Slilaty
;
Thomas Zaslavsky
Reflect-push methods. I: Two dimensional techniques
Nikola Kuzmanovski
;
Jamie Radcliffe
Poset structure concerning cylindric diagrams
Takeshi Suzuki
;
Kento Nakada
;
Yoshitaka Toyosawa
The largest crossing number of tanglegrams
Éva Czabarka
;
Junsheng Liu
;
László Székely
Spectral radius of graphs with given size and odd girth
Zhenzhen Lou
;
Lu Lu
;
Xueyi Huang
Schnyder woods and Alon-Tarsi number of planar graphs
Jakub Kozik
;
Bartosz Podkanowicz
An Ore-type condition for hamiltonicity in tough graphs and the extremal examples
Masahiro Sanka
;
Songling Shan
The squish map and the \(\mathrm{SL}_2\) double dimer model
Leigh Foster
;
Benjamin Young
Bounding mean orders of sub-\(k\)-trees of \(k\)-trees
Stijn Cambie
;
Bradley McCoy
;
Stephan Wagner
;
Corrine Yap
Interlacing property of a family of generating polynomials over Dyck paths
Bo Wang
;
Candice X.T. Zhang
Crystal isomorphisms and Mullineux involution. II
Nicolas Jacon
;
Cédric Lecouvey
Parabolic Tamari lattices in linear type \(B\)
Wenjie Fang
;
Henri Mühle
;
Jean-Christophe Novelli
On symmetric bi-Cayley graphs of prime valency on nonabelian simple groups
Ran Ju
;
Jing jian Li
;
Zai ping Lu
Highly connected graphs have highly connected spanning bipartite subgraphs
Raphael Yuster
An asymptotically sharp bound on the maximum number of independent transversals
Jake Ruotolo
;
Kevin Wang
;
Fan Wei
On disjunctive Rado numbers for some sets of equations
A. Dileep
;
Jai Moondra
;
Amitabha Tripathi
On the anti-Ramsey threshold for non-balanced graphs
Pedro Araújo
;
Taísa Martins
;
Letícia Mattos
;
Walner Mendonça
;
Luiz Moreira
;
Guilherme O. Mota