Peter van Hintum and Peter Keevash

Locality in sumsets

Peter Frankl, Janos Pach and Dömötör Pálvölgyi

Odd-Sunflowers

József Balogh, William Linz and Balazs Patkos

On the sizes of t-intersecting k-chain-free families

Denys Bulavka and Russ Woodroofe

Strict Erdős-Ko-Rado for simplicial complexes

Asaf Shapira and Mykhaylo Tyomkyn

A new approach for the Brown-Erdős-Sós problem

Gilles Schaeffer

On universal singular exponents in equations with one catalytic parameter of order one

Jessica Enright, Kitty Meeks, William Pettersson and John Sylvester

Tangled Paths: A Random Graph Model from Mallows Permutations

Colin Desmarais, Cecilia Holmgren and Stephan Wagner

The root cluster after percolation on preferential attachment trees

Annika Heckel, Marc Kaufmann, Noela Müller and Matija Pasch

The hitting time of clique factors

José D. Alvarado, Gabriel D. Do Couto and Simon Griffiths

Moderate deviations of triangle counts - the lower tail

Fábio Botler, Cristina Fernandes and Juan Gutiérrez

Independent dominating sets in planar triangulations

Maya Sankar

The Turán Number of Surfaces

Petr Hlineny and Adam Straka

Stack and Queue Numbers of Graphs Revisited

Benjamin Moore, Robert Šámal, Zdeněk Dvořák and Michaela Seifrtová

Precoloring extension in planar near-Eulerian-triangulations

Marc Distel, Robert Hickingbotham, Michał T. Seweryn and David R. Wood

Powers of planar graphs, product structure, and blocking partitions

Zoltán Lóránt Nagy and Benedek Kovács

Avoiding intersections of given size in finite affine spaces AG(n,2)

Zhihan Jin and István Tomon

Semi-algebraic and semi-linear Ramsey numbers

Maximilian Wötzel

The structure of Sidon set systems

Bryce Frederickson and Liana Yepremyan

Upper bounds on Ramsey numbers for vector spaces over finite fields

Juanjo Rué and Christoph Spiegel

The Rado Multiplicity Problem in Vector Spaces over Finite Fields

Michael Anastos

Constructing Hamilton cycles and perfect matchings efficiently

Bertille Granet and Felix Joos

Random perfect matchings in regular graphs

Candida Bowtell, Robert Hancock and Joseph Hyde

A resolution of the Kohayakawa--Kreuter conjecture for the majority of cases

Eyal Ackerman and Balázs Keszegh

On the number of tangencies among 1-intersecting curves

Gábor Damásdi, Nora Frankl, Janos Pach and Dömötör Pálvölgyi

Monochromatic configurations on a circle

Sudatta Bhattacharya, Zdenek Dvorak and Fariba Noorizadeh

Chromatic number of intersection graphs of segments with two slopes

Sofia Brenner and Irene Heinrich

Countable ultrahomogeneous 2-colored graphs consisting of disjoint unions of cliques

Noé de Rancourt, Tristan Bice, Jan Hubička and Matěj Konečný

Big Ramsey degrees in the metric setting

Andres Aranda, David Chodounský, Jan Hubička, Matěj Konečný, Jaroslav Nešetřil, Andy Zucker and Samuel Braunfeld

Type-respecting amalgamation and big Ramsey degrees

Joshua Erde, Mihyun Kang, Florian Lehner, Bojan Mohar and Dominik Schmid

Cop number of random k-uniform hypergraphs

Anthony Bonato, Florian Lehner, Trent Marbach and Jd Nir

The Localization game on locally finite trees

Bojan Mohar, Vesna Iršič and Alexandra Wesolek

Cops and Robber on Hyperbolic Manifolds

Nemanja Draganić, David Munha Correia and Benny Sudakov

A generalization of Bondy’s pancyclicity theorem

Arturo Merino, Torsten Mütze and Namrata

Kneser graphs are Hamiltonian

Matt DeVos and Kathryn Nurse

Cycles through two edges in signed graphs

Nemanja Draganić, David Munhá Correia and Benny Sudakov

Chvátal-Erdős condition for pancyclicity

Joanna Ellis-Monaghan and M. N. Ellingham

Maximum genus orientable embeddings from circuit decompositions of dense eulerian graphs and digraphs

Ioannis Eleftheriadis, Samuel Braunfeld, Anuj Dawar and Aris Papadopoulos

Monadic NIP in monotone classes of relational structures

Petr Hlineny

Twin-width of Planar Graphs; a Short Proof

Sam Braunfeld, Jaroslav Nesetril, Patrice Ossona de Mendez and Sebastian Siebertz

Decomposition horizons: from graph sparsity to model-theoretic dividing lines

Édouard Bonnet, Jaroslav Nesetril, Patrice Ossona de Mendez, Sebastian Siebertz and Stephan Thomassé

Twin-width and permutations

Dhanyamol Antony, Sagartanu Pal and R.B. Sandeep

Algorithms for subgraph complementation to some classes of graphs

Yanitsa Pehova and Kalina Petrova

Minimum vertex degree conditions for loose spanning trees in 3-graphs

Maya Stein and Camila Zárate-Guerén

Semidegree, edge density and antidirected subgraphs

Lior Gishboliner, Benny Sudakov and Zhihan Jin

The Minimum Degree Removal Lemma Thresholds

Pranshu Gupta, Fabian Hamann, Alp Müyesser, Olaf Parczyk and Amedeo Sgueglia

A general approach to transversal versions of Dirac-type theorems

Alberto Espuny Díaz, Lyuben Lichev, Dieter Mitsche and Alexandra Wesolek

Sharp threshold for embedding balanced spanning trees in random geometric graphs

David Hartman, Tomáš Hons and Jaroslav Nešetřil

Rooting algebraic vertices of convergent sequences

Andrzej Grzesik, Daniel Kráľ and Oleg Pikhurko

Forcing Generalized Quasirandom Graphs Efficiently

Eng Keat Hng and Jan Hladký

Fractionally Isomorphic Graphs and Graphons

Frederik Garbe, Daniel Kral, Alexandru Malekshahian and Raul Penaguiao

The dimension of the feasible region of pattern densities

Hanka Řada and Jan Hladký

Permutation flip processes

Hyunwoo Lee

On Perfect Subdivision Tilings

Peter Allen, Julia Böttcher and Domenico Mergoni Cecchell

Partition Universality for Hypergraphs of Bounded Degeneracy and Degree

Rajiv Raman and Karamjeet Singh

On Hypergraph Supports

Seonghyuk Im, Jaehoon Kim, Younjin Kim and Hong Liu

Crux, space constraints and subdivisions

Stijn Cambie, Penny Haxell, Ross J. Kang and Ronen Wdowinski

A precise condition for independent transversals in bipartite covers

Lucas Aragão, Maurício Collares, Joäo Pedro Marciano, Taísa Martins and Robert Morris

A lower bound for set-colouring Ramsey numbers

Domagoj Bradac, Nemanja Draganic and Benny Sudakov

Effective bounds for induced size-Ramsey numbers of cycles

Martin Balko and Marian Poljak

On ordered Ramsey numbers of matchings versus triangles

Quentin Dubroff, António Girão, Eoin Hurley and Corrine Yap

Tower gaps in multicolour Ramsey numbers

Simona Boyadzhiyska and Allan Lo

Tight path, what is it (Ramsey-)good for? Absolutely (almost) nothing!

Noga Alon, Anurag Bishnoi, Shagnik Das and Alessandro Neri

Expander graphs, strong blocking sets and minimal codes

Jop Briët and Davi Castro-Silva

Raising the roof on the threshold for Szemerédi's theorem with random differences

David Chodounsky and Lluis Vena

A compactification of the set of sequences of positive real numbers with applications to limits of graphs

Jop Briët and Davi Castro-Silva

Random restrictions of high-rank tensors and polynomial maps

Thomas Karam

High-rank subtensors of high-rank tensors

Jakub Przybyło and Fan Wei

On asymptotic confirmation of the Faudree-Lehel Conjecture on the irregularity strength of graphs

Babak Ghanbari, David Hartman, Vít Jelínek, Aneta Pokorná, Robert Šámal and Pavel Valtr

On the structure and values of betweenness centrality in dense betweenness-uniform graphs

Louis Esperet, Ugo Giocanti and Clément Legrand-Duchesne

The structure of quasi-transitive graphs avoiding a minor with applications to the domino problem

Ján Karabáš, Edita Macajova, Roman Nedela and Martin Skoviera

Perfect-matching covers of cubic graphs with colouring defect 3

Fábio Botler, Andrea Jiménez, Carla N. Lintzmayer, Adrián Pastine, Daniel A. Quiroz and Maycon Sambinelli

Biclique immersions in graphs with independence number 2

Jordi Castellví, Michael Drmota, Marc Noy and Clément Requilé

Chordal graphs with bounded tree-width

Emma Caizergues and Elie de Panafieu

Exact enumeration of graphs and bipartite graphs with degree constraints

Anders Claesson, Mark Dukes, Atli Fannar Franklín and Sigurður Örn Stefánsson

Counting tournament score sequences

Corentin Henriet, Luca Ferrari and Lapo Cioni

A direct bijection between two-stack sortable permutations and fighting fish

George Kontogeorgiou and Martin Winter

(Random) Trees of Intermediate Volume Growth

Jonathan Narboni

Vizing's edge-recoloring conjecture holds

Linda Cook, Tomáš Masařík, Marcin Pilipczuk, Amadeus Reinald and Uéverton S. Souza

Proving a directed analogue of the Gyárfás-Sumner conjecture for orientations of P_4

Yangyan Gu, Yiting Jiang, David Wood and Xuding Zhu

Refined list version of Hadwiger’s Conjecture

Marthe Bonamy, Marc Heinrich, Clément Legrand-Duchesne and Jonathan Narboni.

On a recolouring version of Hadwiger’s conjecture

Kathleen Barsse, Daniel Gonçalves and Matthieu Rosenfeld

Nonrepetitive colorings of $\mathbb{R}^d$

Allan Lo, Viresh Patel and Mehmet Akif Yildiz

Cycle Partition of Dense Regular Digraphs and Oriented Graphs

Allan Lo and Vincent Pfenninger

Almost partitioning every 2-edge-coloured complete k-graph into k monochromatic tight cycles

Julien Duron, Frédéric Havet, Florian Hörsch and Clément Rambaud

On the minimum number of inversions to make a digraph k-(arc-)strong

Akbar Davoodi, Diana Piguet, Hanka Řada and Nicolós Sanhueza-Matamala

Beyond the Erdős-Sós conjecture

Richard Lang

Tiling dense hypergraphs

Igor Araujo, Simón Piga, Andrew Treglown and Zimu Xiang

Tiling problems in edge-ordered graphs

Gabor Kun and Panna Timea Fekete

A polynomial removal lemma for posets

Paul Bastide, Carla Groenland, Hugo Jacob and Tom Johnston

Exact antichain saturation numbers via a generalisation of a result of Lehman-Ron

Andrea Freschi, Simon Piga, Maryam Sharifzadeh and Andrew Treglown

A general bound for the induced poset saturation problem

Umberto De Ambroggio, Tamas Makai and Konstantinos Panagiotou

Dispersion on the Complete Graph

Zéphyr Salvy

Unified study of the phase transition for block-weighted random planar maps

Igor Araujo, József Balogh, Robert Krueger, Simón Piga and Andrew Treglown

Cycles of every length and orientation in randomly perturbed digraphs

Amin Coja-Oghlan, Mihyun Kang, Lena Krieg and Maurice Rolvien

The k-XORSAT threshold revisited

Stefan Glock, David Munha Correia and Benny Sudakov

Hamilton cycles in pseudorandom graphs

Kyriakos Katsamaktsis, Shoham Letzter and Amedeo Sgueglia

Rainbow spanning trees in uniformly coloured perturbed graphs

Zequn Lv, Ervin Győri, Zhen He, Nika Salia, Casey Tompkins and Xiutao Zhu

The maximum number of copies of an even cycle in a planar graph

Sebastian Babiński, Andrzej Grzesik and Magdalena Prorok

Directed graphs without rainbow triangles

Gaurav Kucheriya and Gábor Tardos

On edge-ordered graphs with linear extremal functions

Ervin Győri and Nika Sala

3-uniform linear hypergraphs without a long Berge path

Sebastian Babiński and Andrzej Grzesik

Graphs without a rainbow path of length 3

Jialu Zhu and Xuding Zhu

Minimum non-chromatic-λ-choosable graphs

Ararat Harutyunyan and Gil Puig i Surroca

Colouring complete multipartite and Kneser-type digraphs

Lucas Picasarri-Arrieta

Strengthening the Directed Brooks' Theorem for oriented graphs and consequences on digraph redicolouring

Peter Bradshaw and Tomáš Masařík

Single-conflict colorings of degenerate graphs

Jan Kratochvil and Roman Nedela

Graph covers and generalized snarks

Miquel Ortega, Juanjo Rué and Oriol Serra

Product-free sets in the free group

Benedek Kovács

Finding pairwise disjoint vector pairs in F_2^n with a prescribed sequence of differences

Joshua Erde, Peter Keevash, Alexander Roberts and Ben Barber

Isoperimetric stability in lattices

Simone Costa, Stefano Della Fiore and Andrea Ferraguti

Higher degree Erdős distinct evaluations problem

Edward Dobson, Ademir Hujdurović, Wilfried Imrich and Ronald Ortner

When is Cartesian product a Cayley graph?