Parcourir par
Collections
Sources
Geodesic
Parcourir par
Collections
Sources
The electronic journal of combinatorics
Tome 32 (2025)
no. 3
Précédent
Suivant
Tome 32 (2025) no. 3
Sommaire
Colouring complete multipartite and Kneser-type digraphs
Ararat Harutyunyan
;
Gil Puig i Surroca
Counting graph orientations with no directed triangles
Pedro Araújo
;
Fábio Botler
;
Guilherme Oliveira Mota
The complexity of the greedoid Tutte polynomial
Christopher Knapp
;
Steven Noble
On subdivisions of four blocks cycles with two non-consecutive blocks of length one in digraphs with large chromatic number
Darine Al-Mniny
;
Soukaina Zayat
Forbidden pairs for traceability of 2-connected graphs
Shipeng Wang
;
Liming Xiong
Pattern-avoiding modified ascent sequences
Giulio Cerbai
Rainbow common graphs must be forests
Yihang Sun
Characterizations of perfectly clustering words
Mélodie Lapointe
;
Christophe Reutenauer
On the fractional matching extendability of Cayley graphs of abelian groups
Boštjan Kuzman
;
Primož Šparl
Hindrance from a wasteful partial linkage
Attila Joó
De Bruijn sequences: from games to shift-rules to a proof of the Fredricksen-Kessler-Maiorana theorem
Gal Amram
;
Amir Rubin
;
Yotam Svoray
;
Gera Weiss
Isoperimetry in product graphs
Sahar Diskin
;
Wojciech Samotij
Flag-transitive point-primitive quasi-symmetric \(2\)-designs and exceptional groups of Lie type
Jianbing Lu
A lower bound on the saturation number and a strengthening for triangle-free graphs
Calum Buchanan
;
Puck Rombach
Clustered colouring of graph products
Rutger Campbell
;
J. Pascal Gollin
;
Kevin Hendrey
;
Thomas Lesgourgues
;
Bojan Mohar
;
Youri Tamitegama
;
Jane Tan
;
David R. Wood
On the number of monochromatic cliques in a graph
Deepak Bal
;
Jonathan Cutler
;
Luke Pebody
Thin edges in claw-free bricks
Jinxin Xue
;
Fuliang Lu
On Fourier coefficients of sets with small doubling
Ilya D. Shkredov
On card guessing games: limit law for one-time riffle shuffle
Markus Kuba
;
Alois Panholzer
Restricted van der Waerden theorem for nilprogressions
Sayan Goswami
Bakry-Émery and Ollivier Ricci curvature of Cayley graphs
David Cushing
;
Supanat Kamtue
;
Riikka Kangaslampi
;
Shiping Liu
;
Florentin Münch
;
Norbert Peyerimhoff
Alon's transmitting problem and multicolor Beck-Spencer Lemma
Norihide Tokushige
A new strategy for finding spanning trees without small degree stems
Michitaka Furuya
;
Shoichi Tsuchiya
Invariant equations in many variables
Tomasz Kościuszko
On the number of generalized numerical semigroups
Sean Li
Characterising 4-tangles through a connectivity property
Johannes Carmesin
;
Jan Kurkofka
A note on strong blocking sets and higgledy-piggledy sets of lines
Stefano Lia
;
Geertrui Van de Voorde
Cops and robber -- when capturing is not surrounding
Paul Jungeblut
;
Samuel Schneider
;
Torsten Ueckerdt
Paths, cycles and sprinkling in random hypergraphs
Oliver Cooley
Rainbow triangles sharing one common vertex or edge
Xiaozheng Chen
;
Bo Ning
Combinatorics of Castelnuovo-Mumford regularity of binomial edge ideals
Adam LaClair
Structure and growth of \(\mathbb{R}\)-Bonacci words
Sergey Dovgal
;
Sergey Kirgizov
\(s\)-stable Kneser graphs are Hamiltonian
Agustina V. Ledezma
;
Adrián Pastine
Bounded fractional intersecting families are linear in size
Niranjan Balachandran
;
Shagnik Das
;
Brahadeesh Sankarnarayanan
Creating spanning trees in Waiter-Client games
Grzegorz Adamski
;
Sylwia Antoniuk
;
Małgorzata Bednarska-Bzdęga
;
Dennis Clemens
;
Fabian Hamann
;
Yannick Mogge
Treewidth is NP-complete on cubic graphs
Hans Bodlaender
;
Édouard Bonnet
;
Lars Jaffke
;
Dušan Knop
;
Paloma Lima
;
Martin Milanič
;
Sebastian Ordyniak
;
Sukanya Pandey
;
Ondřej Suchý
A characterization of \(4\)-connected graphs with no \(K_{3, 3}+v\)-minor
Linsong Wei
;
Yuqi Xu
;
Weihua Yang
;
Yunxia Zhang
A note on directed analogues of the Sidorenko and forcing conjectures
Jacob Fox
;
Zoe Himwich
;
Nitya Mani
;
Yunkun Zhou
Some results on fractional vs. expectation thresholds
Thomas Fischer
;
Yury Person
A note on the map expansion of Jack polynomials
Houcine Ben Dali
Shotgun assembly of Linial-Meshulam model
Kartick Adhikari
;
Sukrit Chakraborty
LDP polygons and the number 12 revisited
Ulrike Bücking
;
Christian Haase
;
Karin Schaller
;
Jan-Hendrik de Wiljes
Star colouring and locally constrained graph homomorphisms
Cyriac Antony
;
Shalu M. A.
Enumerating 1324-avoiders with few inversions
Svante Linusson
;
Emil Verkama
Clique covers of complete graphs and piercing multitrack intervals
János Barát
;
András Gyárfás
;
Gábor N. Sárközy
Bounding the SNPR distance between two tree-child networks using generalised agreement forests
Steven Kelk
;
Simone Linz
;
Charles Semple
Descents and flag major index on conjugacy classes of colored permutation groups without short cycles
Kevin Liu
;
Mei Yin
Dimensions of compositions modulo a prime
Jia Huang
The multi-generating function for intervals in Young's lattice: some comments on a paper by Azam and Richmond
Jan Snellman
A note on the structure of locally finite planar quasi-transitive graphs
Ugo Giocanti
Cubic edge-transitive graphs of order \(2p^4\)
Xue Wang
;
Sejeong Bang
;
Jin-Xin Zhou
The free product of \(q\)-matroids
Gianira N. Alfarano
;
Eimear Byrne
;
Andrew Fulcher
A linear lower bound for the square energy of graphs
Saieed Akbari
;
Hitesh Kumar
;
Bojan Mohar
;
Shivaramakrishna Pragada
Universality in prelimiting tail behavior for regular subgraph counts in the Poisson regime
Mriganka Basu Roy Chowdhury
On co-edge-regular graphs with \(4\) distinct eigenvalues
Hong-Jun Ge
;
Jack H. Koolen