Volume 32, Issue 3 (2025)

Colouring Complete Multipartite and Kneser-Type Digraphs

Ararat Harutyunyan, Gil Puig i Surroca

P3.1
- PDF
Counting Graph Orientations with No Directed Triangles

Pedro Araújo, Fábio Botler, Guilherme Oliveira Mota

P3.2
- PDF
The Complexity of the Greedoid Tutte Polynomial

Christopher Knapp, Steven Noble

P3.3
- PDF
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

P3.4
- PDF
Forbidden Pairs for Traceability of 2-Connected Graphs

Shipeng Wang, Liming Xiong

P3.5
- PDF
Pattern-Avoiding Modified Ascent Sequences

Giulio Cerbai

P3.6
- PDF
Rainbow Common Graphs Must Be Forests

Yihang Sun

P3.7
- PDF
Characterizations of Perfectly Clustering Words

Mélodie Lapointe, Christophe Reutenauer

P3.8
- PDF
On the Fractional Matching Extendability of Cayley Graphs of Abelian Groups

Boštjan Kuzman, Primož Šparl

P3.9
- PDF
Hindrance from a Wasteful Partial Linkage

Attila Joó

P3.10
- PDF
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

P3.11
- PDF
Isoperimetry in Product Graphs

Sahar Diskin, Wojciech Samotij

P3.12
- PDF
Flag-Transitive Point-Primitive Quasi-Symmetric $2$-Designs and Exceptional Groups of Lie Type

Jianbing Lu

P3.13
- PDF
A Lower Bound on the Saturation Number and a Strengthening for Triangle-Free Graphs

Calum Buchanan, Puck Rombach

P3.14
- PDF
Clustered Colouring of Graph Products

Rutger Campbell, J. Pascal Gollin, Kevin Hendrey, Thomas Lesgourgues, Bojan Mohar, Youri Tamitegama, Jane Tan, David R. Wood

P3.15
- PDF
On the Number of Monochromatic Cliques in a Graph

Deepak Bal, Jonathan Cutler, Luke Pebody

P3.16
- PDF
Thin Edges in Claw-Free Bricks

Jinxin Xue, Fuliang Lu

P3.17
- PDF
On Fourier Coefficients of Sets with Small Doubling

Ilya D. Shkredov

P3.18
- PDF
On Card Guessing Games: Limit Law for One-Time Riffle Shuffle

Markus Kuba, Alois Panholzer

P3.19
- PDF
Restricted van der Waerden Theorem for Nilprogressions

Sayan Goswami

P3.20
- PDF
Bakry-Émery and Ollivier Ricci Curvature of Cayley Graphs

David Cushing, Supanat Kamtue, Riikka Kangaslampi, Shiping Liu, Florentin Münch, Norbert Peyerimhoff

P3.21
- PDF
Alon's Transmitting Problem and Multicolor Beck-Spencer Lemma

Norihide Tokushige

P3.22
- PDF
A New Strategy for Finding Spanning Trees without Small Degree Stems

Michitaka Furuya, Shoichi Tsuchiya

P3.23
- PDF
Invariant Equations in Many Variables

Tomasz Kościuszko

P3.24
- PDF
On the Number of Generalized Numerical Semigroups

Sean Li

P3.25
- PDF
Characterising 4-Tangles Through a Connectivity Property

Johannes Carmesin, Jan Kurkofka

P3.26
- PDF
A Note on Strong Blocking Sets and Higgledy-Piggledy Sets of Lines

Stefano Lia, Geertrui Van de Voorde

P3.27
- PDF
Cops and Robber - When Capturing is not Surrounding

Paul Jungeblut, Samuel Schneider, Torsten Ueckerdt

P3.28
- PDF
Paths, Cycles and Sprinkling in Random Hypergraphs

Oliver Cooley

P3.29
- PDF
Rainbow Triangles Sharing One Common Vertex or Edge

Xiaozheng Chen, Bo Ning

P3.30
- PDF
Combinatorics of Castelnuovo-Mumford Regularity of Binomial Edge Ideals

Adam LaClair

P3.31
- PDF
Structure and Growth of $\mathbb{R}$-Bonacci Words

Sergey Dovgal, Sergey Kirgizov

P3.32
- PDF
$s$-Stable Kneser Graph are Hamiltonian

Agustina V. Ledezma, Adrián Pastine

P3.33
- PDF
Bounded Fractional Intersecting Families are Linear in Size

Niranjan Balachandran, Shagnik Das, Brahadeesh Sankarnarayanan

P3.34
- PDF
Creating Spanning Trees in Waiter-Client Games

Grzegorz Adamski, Sylwia Antoniuk, Małgorzata Bednarska-Bzdęga, Dennis Clemens, Fabian Hamann, Yannick Mogge

P3.35
- PDF
Treewidth is NP-Complete on Cubic Graphs

Hans L. Bodlaender, Édouard Bonnet, Lars Jaffke, Dušan Knop, Paloma T. Lima, Martin Milanič, Sebastian Ordyniak, Sukanya Pandey, Ondřej Suchý

P3.36
- PDF
A Characterization of $4$-Connected Graphs with no $ K_{3,3}+v $-Minor

Linsong Wei, Yuqi Xu, Weihua Yang, Yunxia Zhang

P3.37
- PDF