Parcourir par
Collections
Sources
Geodesic
Parcourir par
Collections
Sources
The electronic journal of combinatorics
Tome 32 (2025)
no. 1
Précédent
Suivant
Tome 32 (2025) no. 1
Sommaire
The 3-dicritical semi-complete digraphs
Frédéric Havet
;
Florian Hörsch
;
Lucas Picasarri-Arrieta
On the asymptotic behavior for partitions separated by parity
Kathrin Bringmann
;
William Craig
;
Caner Nazaroglu
Counting occurrences of patterns in permutations
Andrew Conway
;
Anthony Guttmann
A refinement of and a companion to MacMahon's partition identity
Matthew Russell
Maximum spread of \(K_{s,t}\)-minor-free graphs
William Linz
;
Linyuan Lu
;
Zhiyu Wang
A constructive winning maker strategy in the maker-breaker \(C_4\)-game
Matthias Sowa
;
Anand Srivastav
On (shape-)Wilf-equivalence of certain sets of (partially ordered) patterns
Alexander Burstein
;
Tian Han
;
Sergey Kitaev
;
Philip B. Zhang
Long cycles in percolated expanders
Maurício Collares
;
Sahar Diskin
;
Joshua Erde
;
Michael Krivelevich
Sharp Szemerédi-Trotter constructions in the plane
Larry Guth
;
Olivine Silier
Piercing independent sets in graphs without large induced matching
Jiangdong Ai
;
Hong Liu
;
Zixiang Xu
;
Qiang Zhou
Kromatic quasisymmetric functions
Eric Marberg
Demazure crystals for flagged key polynomials
Jiayi Wen
Homological algebra of Nakayama algebras and 321-avoiding permutation
Eirini Chavli
;
Rene Marczinzik
Permanental inequalities for totally positive matrices
Mark Skandera
;
Daniel Soskin
The clairvoyant maître d'
Reed Acton
;
T. Kyle Petersen
;
Blake Shirman
;
Bridget Eileen Tenner
Generalized Ramsey numbers at the linear and quadratic thresholds
Patrick Bennett
;
Ryan Cushman
;
Andrzej Dudek
The linear \(q\)-hypergraph process
Sayok Chakravarty
;
Nicholas Spanier
On the quantum chromatic numbers of small graphs
Olivier Lalonde
Independent removable edges in cubic bricks
Fuliang Lu
;
Jianguo Qian
The maximum number of connected sets in regular graphs
Stijn Cambie
;
Jorik Jooken
;
Jan Goedgebeur
On the evolution of random integer compositions
David Bevan
;
Dan Threlfall
A proof of the \((n, k, t)\) conjectures
Stacie Baumann
;
Joseph Briggs
A note on uncountably chromatic graphs
Nathan Bowler
;
Max Pitz
New strongly regular graphs found via local search for partial difference sets
Andrew Brady
The number of edge colorings with small independence number and no monochromatic \(H\)
Xinyu Hu
;
Qizhong Lin
;
Jiaxi Nie
Graphs without a 3-connected subgraph are 4-colourable
Édouard Bonnet
;
Carl Feghali
;
Tung Nguyen
;
Alex Scott
;
Paul Seymour
;
Stéphan Thomassé
;
Nicolas Trotignon
On set representation of bounded degree hypergaphs
Ayush Basu
;
Griffin Johnston
;
Vojtěch Rödl
;
Marcelo Sales
Lower bounds on face numbers of polytopes with \(m\) facets
Joshua Hinman
Generalized crowns in linear \(r\)-graphs
Lin-Peng Zhang
;
Hajo Broersma
;
Ligong Wang
The minimum spectral radius of \(tP_3\)- or \(K_5\)-saturated graphs via the number of \(2\)-walks
Jiangdong Ai
;
Pei Liu
;
Suil O
;
Junxue Zhang
A hypergraph analog of Dirac's theorem for long cycles in 2-connected graphs. II: Large uniformities
Alexandr Kostochka
;
Ruth Luo
;
Grace McCourt
An interlacing property of the signless Laplacian of threshold graphs
Christoph Helmberg
;
Guilherme Porto
;
Guilherme Torres
;
Vilmar Trevisan
Some bounds on the threshold dimension of graphs
Mathew C. Francis
;
Atrayee Majumder
;
Rogers Mathew
The degree threshold for covering with all the connected \(3\)-graphs with \(3\) edges
Yue Ma
;
Xinmin Hou
;
Zhi Yin
Minimum degree conditions for Hamilton \(l\)-cycles in \(k\)-uniform hypergraphs
Jie Han
;
Lin Sun
;
Guanghui Wang
Braces of perfect matching width 2
Archontia C. Giannopoulou
;
Meike Hatzel
;
Sebastian Wiederrecht
Structural Szemerédi-Trotter for lattices and their generalizations
Shival Dasu
;
Adam Sheffer
;
Junxuan Shen
Pascal's formulas and vector fields
Philippe Chassaing
;
Jules Flin
;
Alexis Zevio
A combinatorial interpretation of the noncommutative inverse Kostka matrix
Edward Allen
;
Sarah Katherine Mason
Ascent sequences avoiding a triple of length-3 patterns
David Callan
;
Toufik Mansour
Shellability of componentwise discrete polymatroids
Antonino Ficarra
Problems, proofs, and disproofs on the inversion number
Guillaume Aubian
;
Frédéric Havet
;
Florian Hörsch
;
Felix Kingelhoefer
;
Nicolas Nisse
;
Clément Rambaud
;
Quentin Vermande
Low rank groups of Lie type acting point- and line-primitively on finite generalised quadrangles
Vishnuram Arumugam
;
John Bamberg
;
Michael Giudici
A note on the invertibility of oriented graphs
Natalie Behague
;
Tom Johnston
;
Natasha Morrison
;
Shannon Ogden
The image of a tropical linear space
Joshua Mundinger
The construction of a class of presentations for Specht modules
Tamar Friedmann
On the minimum density of monotone subwords
Raphael Yuster
A special class of pure \(O\)-sequences
Tài Huy Hà
;
Takayuki Hibi
;
Fabrizio Zanello
The Norton-balanced condition for \(Q\)-polynomial distance-regular graphs
Kazumasa Nomura
;
Paul Terwilliger
Polynomial bounds for monochromatic tight cycle partition in \(r\)-edge-coloured \(K_n^{(k)}\)
Debmalya Bandyopadhyay
;
Allan Lo
Algebraic characterization of dendricity
France Gheeraert
;
Herman Goulet-Ouellet
;
Julien Leroy
;
Pierre Stas
Smoothed analysis of the Komlós conjecture: Rademacher noise
Elad Aigner-Horev
;
Dan Hefetz
;
Michael Trushkin
A combinatorial perspective on the noncommutative symmetric functions
Angela Hicks
;
Robert McCloskey
On commutative association schemes and associated (directed) graphs
Giusy Monzillo
;
Safet Penjić
Saturation of \(k\)-chains in the Boolean lattice
Ryan Martin
;
Nick Veldt
Mixed graphs determined by their generalized Hermitian adjacency spectrum based on Eisenstein integers
Yizhe Ji
;
Wei Wang
;
Wei Wang
;
Hao Zhang