Parcourir par
Collections
Sources
Geodesic
Parcourir par
Collections
Sources
The electronic journal of combinatorics
Tome 32 (2025)
no. 2
Précédent
Suivant
Tome 32 (2025) no. 2
Sommaire
What is a \(4\)-connected matroid?
Nick Brettell
;
Susan Jowett
;
James Oxley
;
Charles Semple
;
Geoff Whittle
Every signed planar graph of girth 5 has circular chromatic number strictly less than 4
Jiaao Li
;
Xueliang Li
;
Zhiqian Wang
Fusions of the tensor product of a strongly regular graph
Allen Herman
;
Neha Joshi
Rank functions and invariants of delta-matroids
Matt Larson
Signed circuit \(6\)-covers of signed \(K_4\)-minor-free graphs
You Lu
;
Rong Luo
;
Zhengke Miao
;
Cun-Quan Zhang
A three-regime theorem for flow-firing
Sarah Brauner
;
Galen Dorpalen-Barry
;
Selvi Kara
;
Caroline Klivans
;
Lisa Schneider
Realizability in Matoušek unique sink orientations: characterization and complexity gap
Bernd Gärtner
;
Simon Weber
;
Joel Widmer
On the order of \(P\)-strict promotion on \(\mathsf{V}\times [\ell]\)
Benjamin Adenbaum
On the order sequence of a group
Peter J. Cameron
;
Hiranya Kishore Dey
Reflection groups and quiver mutation: diagrammatics
Patrick Wegener
The skew immaculate Hecke poset and 0-Hecke modules
Nadia Lafrenière
;
Rosa Orellana
;
Anna Pun
;
Sheila Sundaram
;
Stephanie van Willigenburg
;
Tamsen Whitehead McGinley
Simplicial complexes and matroids with vanishing \(T^2\)
Alexandru Constantinescu
;
Patricia Klein
;
Thái Thành Nguyễn
;
Anurag Singh
;
Lorenzo Venturello
Graphs with large clique number whose second largest eigenvalue does not exceed \((\sqrt{5}-1)/2\)
Muhuo Liu
;
Chaohui Chen
;
Zoran Stanić
;
Haiying Shan
Turán colourings in off-diagonal Ramsey multiplicity
Joseph Hyde
;
Jae-baek Lee
;
Jonathan A. Noel
Randomized algorithms to generate hypergraphs with given degree sequences
Michela Ascolese
;
Matthias Lienau
;
Matthias Schulte
;
Anusch Taraz
List colorings of \(k\)-partite \(k\)-graphs
Abhishek Dhawan
Weighted tree games
Patrick Bennett
;
Alan Frieze
Generalized spectral characterization of signed trees
Yizhe Ji
;
Wei Wang
;
Hao Zhang
New structures and their applications to variants of zero forcing and propagation time
Leslie Hogben
;
Mark Hunnell
;
Kevin Liu
;
Houston Schuerger
;
Ben Small
;
Yaqi Zhang
New bounds on a generalization of Tuza's conjecture
Alex Parker
A random coloring process gives improved bounds for the Erdős-Gyárfás problem on generalized Ramsey numbers
Patrick Bennett
;
Andrzej Dudek
;
Sean English
Almost all 9-regular graphs have a modulo-5 orientation
Michelle Delcourt
;
Reaz Huq
;
Paweł Prałat
On the \(A_\alpha\)-index of \(C_4\)-free graphs with given order or size
Yuantian Yu
;
Shuchao Li
Grid minors and products
Vida Dujmović
;
Pat Morin
;
David Wood
;
David Worley
A new family of \((q^{4}+1)\)-tight sets with an automorphism group \(F_{4}(q)\)
Tao Feng
;
Weicong Li
;
Qing Xiang
Long cycles and spectral radii in planar graphs
Ping Xu
;
Lin Huiqiu
;
Longfei Fang
Avoidability beyond paths
Vladimir Gurvich
;
Matjaž Krnc
;
Martin Milanič
;
Mikhail Vyalyi
Edge cover through edge coloring
Guantao Chen
;
Songling Shan
Frozen colourings in \(2 K_2\)-free graphs
Manoj Belavadi
;
Kathie Cameron
;
Elias Hildred
On the hyperdeterminants of Steiner distance hypermatrices
Ya-Nan Zheng
3-cluster-free families of subspaces
Gabriel Currier
;
Shahriar Shahriari
Sparse vertex cutsets and the maximum degree
Stéphane Bessy
;
Johannes Rauch
;
Dieter Rautenbach
;
Uéverton S. Souza
A max-min problem on spectral radius and connectedness of graphs
Zhenzhen Lou
;
Changxiang He
Classification of vertex-transitive digraphs of order a product of two distinct primes via automorphism group
Ted Dobson
;
Ademir Hujdurović
;
Klavdija Kutnar
;
Joy Morris
Tangled paths: a random graph model from Mallows permutations
Jessica Enright
;
Kitty Meeks
;
William Pettersson
;
John Sylvester
The ascent lattice on Dyck paths
Jean-Luc Baril
;
Mireille Bousquet-Mélou
;
Sergey Kirgizov
;
Mehdi Naima
A generalization of conjugation of integer partitions
Seamus Albion
;
Theresia Eisenkölbl
;
Ilse Fischer
;
Moritz Gangl
;
Hans Höngesberg
;
Christian Krattenthaler
;
Martin Rubey
Detecting graphical and digraphical regular representations in groups of squarefree order
Joy Morris
;
Gabriel Verret
Bounds for greedy \(B_h\)-sets
Kevin O'Bryant
Degree deviation and spectral radius
Dieter Rautenbach
;
Florian Werner
On the off-diagonal unordered Erdős-Rado numbers
Igor Araujo
;
Dadong Peng
A Mathon-type construction for digraphs and improved lower bounds for Ramsey numbers
Dermot McCarthy
;
Chris Monico
New bounds on families without large sunflowers
Peter Frankl
;
Jian Wang
Uniform recurrence in the Motzkin numbers and related sequences mod \(p\)
Nadav Kohen
How to get the random graph with non-uniform probabilities?
Leonardo Coregliano
;
Jarosław Swaczyna
;
Agnieszka Widz
A combinatorial proof of a symmetry for a refinement of the Narayana numbers
Miklós Bóna
;
Stoyan Dimitrov
;
Gilbert Labelle
;
Yifei Li
;
Joseph Pappe
;
Andrés R. Vindas-Meléndez
;
Yan Zhuang
Generalized quaternion groups with the \(m\)-DCI property
Jinhua Xie
;
Yan-Quan Feng
;
Binzhou Xia
The Latin tableau conjecture
Timothy Y. Chow
;
Mark G. Tiefenbruck
Stability of Cayley graphs and Schur rings
Ademir Hujdurović
;
István Kovács
Lexicographic shellability of sects
Aram Bingham
;
Néstor Fernando Díaz Morera
Bijectivizing the PT-DT correspondence
Cruz Godar
;
Benjamin Young
The largest size of \((t, t+d, t+2d)\)-core partitions
Hyunsoo Cho
;
Kyeongjun Lee
;
Hayan Nam
A variable version of the quasi-kernel conjecture
Jiangdong Ai
;
Xiangzhou Liu
;
Fei Peng
Weak Bruhat interval modules of finite-type \(0\)-Hecke algebras and projective covers
Joshua Bardwell
;
Dominic Searles
The repetition threshold for ternary rich words
James Currie
;
Lucas Mol
;
Jarkko Peltomäki
Covering numbers of some irreducible characters of the symmetric group
Rijubrata Kundu
;
Velmurugan S