● Lior Gishboliner, Benny Sudakov and Zhihan Jin. **The Minimum Degree Removal Lemma Thresholds**.

● 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**.

● Joshua Erde, Mihyun Kang, Florian Lehner, Bojan Mohar and Dominik Schmid. **Cop number of random $k$-uniform hypergraphs**.

● Hyunwoo Lee. **On Perfect Subdivision Tilings**.

● Allan Lo, Viresh Patel and Mehmet Akif Yildiz. **Cycle Partition of Dense Regular Digraphs and Oriented Graphs**.

● Fábio Botler, Cristina Fernandes and Juan Gutiérrez. **Independent dominating sets in planar triangulations**.

● David Hartman, Tomáš Hons and Jaroslav Nešetřil. **Rooting algebraic vertices of convergent sequences**.

● Peter van Hintum and Peter Keevash. **Locality in sumsets**.

● Zéphyr Salvy. **Unified study of the phase transition for block-weighted random planar maps**.

● Sofia Brenner and Irene Heinrich. **Countable ultrahomogeneous 2-colored graphs consisting of disjoint unions of cliques**.

● Peter Allen, Julia Böttcher and Domenico Mergoni Cecchell. **Partition Universality for Hypergraphs of Bounded Degeneracy and Degree**.

● Suyun Jiang, Hong Liu and Nika Salia. **How connectivity affects the extremal number of trees**.

● Kathleen Barsse, Daniel Gonçalves and Matthieu Rosenfeld. **Nonrepetitive colorings of $\mathbb{R}^d$**.

● Sebastian Babiński, Andrzej Grzesik and Magdalena Prorok. **Directed graphs without rainbow triangles**.

● Jialu Zhu and Xuding Zhu. **Minimum non-chromatic-λ-choosable graphs**.

● Noé de Rancourt, Tristan Bice, Jan Hubička and Matěj Konečný. **Big Ramsey degrees in the metric setting**.

● Igor Araujo, József Balogh, Robert Krueger, Simón Piga and Andrew Treglown. **Cycles of every length and orientation in randomly perturbed digraphs**.

● Peter Frankl, Janos Pach and Dömötör Pálvölgyi. **Odd-Sunflowers**.

● Nemanja Draganić, David Munha Correia and Benny Sudakov. **A generalization of Bondy's pancyclicity theorem**.

● Alberto Espuny Díaz, Lyuben Lichev, Dieter Mitsche and Alexandra Wesolek. **Sharp threshold for embedding balanced spanning trees in random geometric graphs**.

● Jun Gao, Oliver Janzer, Hong Liu and Zixiang Xu. **Extremal number of graphs from geometric shapes**.

● Amin Coja-Oghlan, Mihyun Kang, Lena Krieg and Maurice Rolvien. **The $k$-XORSAT threshold revisited**.

● Arturo Merino, Torsten Mütze and Namrata. **Kneser graphs are Hamiltonian**.

● Matt DeVos and Kathryn Nurse. **Cycles through two edges in signed graphs**.

● Ararat Harutyunyan and Gil Puig i Surroca. **Colouring complete multipartite and Kenser-type digraphs**.

● Rajiv Raman and Karamjeet Singh. **On Hypergraph Supports**.

● Maya Sankar. **The Turán Number of Surfaces**.

● Andrzej Grzesik, Daniel Kráľ and Oleg Pikhurko. **Forcing Generalized Quasirandom Graphs Efficiently**.

● Jessica Enright, Kitty Meeks, William Pettersson and John Sylvester. **Tangled Paths: A Random Graph Model from Mallows Permutations**.

● Allan Lo and Vincent Pfenninger. **Almost partitioning every $2$-edge-coloured complete $k$-graph into $k$ monochromatic tight cycles**.

● Miquel Ortega, Juanjo Rué and Oriol Serra. **Product-free sets in the free group**.

● Stefan Glock, David Munha Correia and Benny Sudakov. **Hamilton cycles in pseudorandom graphs**.

● Jakub Przybyło and Fan Wei. **On asymptotic confirmation of the Faudree-Lehel Conjecture on the irregularity strength of graphs**.

● David Chodounský and Lluis Vena. **A compactification of the set of sequences of positive real numbers with applications to limits 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**.

● Seonghyuk Im, Jaehoon Kim, Younjin Kim and Hong Liu. **Crux, space constraints and subdivisions**.

● Benedek Kovács. **Finding pairwise disjoint vector pairs in F_2^n with a prescribed sequence of differences**.

● Gábor Damásdi, Nora Frankl, Janos Pach and Dömötör Pálvölgyi. **Monochromatic configurations on a circle**.

● Gaurav Kucheriya and Gábor Tardos. **On edge-ordered graphs with linear extremal functions**.

● József Balogh, William Linz and Balazs Patkos. **On the sizes of t-intersecting k-chain-free families**.

● Jordi Castellví, Michael Drmota, Marc Noy and Clément Requilé. **Chordal graphs with bounded tree-width**.

● Ervin Győri and Nika Sala. **3-uniform linear hypergraphs without a long Berge path**.

● Ioannis Eleftheriadis, Samuel Braunfeld, Anuj Dawar and Aris Papadopoulos. **Monadic NIP in monotone classes of relational structures**.

● Sudatta Bhattacharya, Zdenek Dvorak and Fariba Noorizadeh. **Chromatic number of intersection graphs of segments with two slopes**.

● Simone Costa, Stefano Della Fiore and Andrea Ferraguti. **Higher degree Erdős distinct evaluations problem**.

● Louis Esperet, Ugo Giocanti and Clément Legrand-Duchesne. **The structure of quasi-transitive graphs avoiding a minor with applications to the domino problem**.

● Kyriakos Katsamaktsis, Shoham Letzter and Amedeo Sgueglia. **Rainbow spanning trees in uniformly coloured perturbed graphs**.

● Zoltán Lóránt Nagy and Benedek Kovács. **Avoiding intersections of given size in finite affine spaces $AG(n,2)$**.

● Sebastian Babiński and Andrzej Grzesik. **Graphs without a rainbow path of length 3**.

● Ján Karabáš, Edita Macajova, Roman Nedela and Martin Skoviera. **Perfect-matching covers of cubic graphs with colouring defect 3**.

● Lucas Picasarri-Arrieta. **Strengthening the Directed Brooks' Theorem for oriented graphs and consequences on digraph redicolouring**.

● Noga Alon, Anurag Bishnoi, Shagnik Das and Alessandro Neri. **Expander graphs, strong blocking sets and minimal codes**.

● Nemanja Draganić, David Munhá Correia and Benny Sudakov. **Chvátal-Erdős condition for pancyclicity**.

● Colin Desmarais, Cecilia Holmgren and Stephan Wagner. **The root cluster after percolation on preferential attachment trees**.

● Michael Anastos. **Constructing Hamilton cycles and perfect matchings efficiently**.

● Yanitsa Pehova and Kalina Petrova. **Minimum vertex degree conditions for loose spanning trees in 3-graphs**.

● 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**.

● 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**.

● Emma Caizergues and Elie de Panafieu. **Exact enumeration of graphs and bipartite graphs with degree constraints**.

● Eng Keat Hng and Jan Hladký. **Fractionally Isomorphic Graphs and Graphons**.

● Stijn Cambie, Penny Haxell, Ross J. Kang and Ronen Wdowinski. **A precise condition for independent transversals in bipartite covers**.

● Zhihan Jin and István Tomon. **Semi-algebraic and semi-linear Ramsey numbers**.

● Jop Briët and Davi Castro-Silva. **Random restrictions of high-rank tensors and polynomial maps**.

● Petr Hlineny. **Twin-width of Planar Graphs; a Short Proof**.

● Eyal Ackerman and Balázs Keszegh. **On the number of tangencies among 1-intersecting curves**.

● Gabor Kun and Panna Timea Fekete. **A polynomial removal lemma for posets**.

● Annika Heckel, Marc Kaufmann, Noela Müller and Matija Pasch. **The hitting time of clique factors**.

● Petr Hlineny and Adam Straka. **Stack and Queue Numbers of Graphs Revisited**.

● Peter Bradshaw and Tomáš Masařík. **Single-conflict colorings of degenerate graphs**.

● Jop Briët and Davi Castro-Silva. **Raising the roof on the threshold for Szemerédi's theorem with random differences**.

● Edward Dobson, Ademir Hujdurović, Wilfried Imrich and Ronald Ortner. **When is Cartesian product a Cayley graph?**.

● Maximilian Wötzel. **The structure of Sidon set systems**.

● Igor Araujo, Simón Piga, Andrew Treglown and Zimu Xiang. **Tiling problems in edge-ordered graphs**.

● Yangyan Gu, Yiting Jiang, David Wood and Xuding Zhu. **Refined list version of Hadwiger's Conjecture**.

● George Kontogeorgiou and Martin Winter. **(Random) Trees of Intermediate Volume Growth**.

● Anders Claesson, Mark Dukes, Atli Fannar Franklín and Sigurður Örn Stefánsson. **Counting tournament score sequences**.

● Bryce Frederickson and Liana Yepremyan. **Upper bounds on Ramsey numbers for vector spaces over finite fields**.

● Maya Stein and Camila Zárate-Guerén. **Semidegree, edge density and antidirected subgraphs**.

● Denys Bulavka and Russ Woodroofe. **Strict Erdős-Ko-Rado for simplicial complexes**.

● Marthe Bonamy, Marc Heinrich, Clément Legrand-Duchesne and Jonathan Narboni. **On a recolouring version of Hadwiger's conjecture**.

● Sam Braunfeld, Jaroslav Nesetril, Patrice Ossona de Mendez and Sebastian Siebertz. **Decomposition horizons: from graph sparsity to model-theoretic dividing lines**.

● Lucas Aragäo, Maurício Collares, Joäo Pedro Marciano, Taísa Martins and Robert Morris. **A lower bound for set-colouring Ramsey numbers**.

● José D. Alvarado, Gabriel D. Do Couto and Simon Griffiths. **MODERATE DEVIATIONS OF TRIANGLE COUNTS - THE LOWER TAIL**.

● Frederik Garbe, Daniel Kral, Alexandru Malekshahian and Raul Penaguiao. **The dimension of the feasible region of pattern densities**.

● Akbar Davoodi, Diana Piguet, Hanka Řada and Nicolás Sanhueza-Matamala. **Beyond the Erdős-Sós conjecture**.

● Benjamin Moore, Robert Šámal, Zdeněk Dvořák and Michaela Seifrtová. **Precoloring extension in planar near-Eulerian-triangulations**.

● Domagoj Bradac, Nemanja Draganic and Benny Sudakov. **Effective bounds for induced size-Ramsey numbers of cycles**.

● Asaf Shapira and Mykhaylo Tyomkyn. **A new approach for the Brown-Erdős-Sás problem**.

● Jan Kratochvil and Roman Nedela. **Graph covers and generalized snarks**.

● Bojan Mohar, Vesna Iršič and Alexandra Wesolek. **Cops and Robber on Hyperbolic Manifolds**.

● 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**.

● 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**.

● Corentin Henriet, Luca Ferrari and Lapo Cioni. **A direct bijection between two-stack sortable permutations and fighting fish**.

● Marc Distel, Robert Hickingbotham, Michał T. Seweryn and David R. Wood. **Powers of planar graphs, product structure, and blocking partitions**.

● Umberto De Ambroggio, Tamas Makai and Konstantinos Panagiotou. **Dispersion on the Complete Graph**.

● Richard Lang. **Tiling combinatorial structure**.

● Bertille Granet and Felix Joos. **Random perfect matchings in regular graphs**.

● Juanjo Rué and Christoph Spiegel. **The Rado Multiplicity Problem in Vector Spaces over Finite Fields**.

● Hanka Řada and Jan Hladký. **Permutation flip processes**.

● Édouard Bonnet, Jaroslav Nesetril, Patrice Ossona de Mendez, Sebastian Siebertz and Stephan Thomassé. **Twin-width and permutations**.

● Pranshu Gupta, Fabian Hamann, Alp Müyesser, Olaf Parczyk and Amedeo Sgueglia. **A general approach to transversal versions of Dirac-type theorems**.

● 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**.

● Gilles Schaeffer. **On universal singular exponents in equations with one catalytic parameter of order one**.

● Anthony Bonato, Florian Lehner, Trent Marbach and Jd Nir. **The Localization game on locally finite trees**.

● Candida Bowtell, Robert Hancock and Joseph Hyde. **A resolution of the Kohayakawa--Kreuter conjecture for the majority of cases**.

● Andrea Freschi, Simon Piga, Maryam Sharifzadeh and Andrew Treglown. **A general bound for the induced poset saturation problem**.

● Rangel Hernández-Ortiz, Kolja Knauer, Luis Pedro Montejano and Manfred Scheucher. **Roudneff's Conjecture in Dimension $4$**.

● Dhanyamol Antony, Sagartanu Pal and R.B. Sandeep. **Algorithms for subgraph complementation to some classes of graphs**.

● Thomas Karam. **High-rank subtensors of high-rank tensors**.

● Paul Bastide, Carla Groenland, Hugo Jacob and Tom Johnston. **Exact antichain saturation numbers via a generalisation of a result of Lehman-Ron**.

● Simona Boyadzhiyska and Allan Lo. **Tight path, what is it (Ramsey-)good for? Absolutely (almost) nothing!**.

● Joshua Erde, Peter Keevash, Alexander Roberts and Ben Barber. **Isoperimetric stability in lattices**.

● Joanna Ellis-Monaghan and M. N. Ellingham. **Maximum genus orientable embeddings from circuit decompositions of dense eulerian graphs and digraphs**.

● Christian Gaetz, Oliver Pechenik, Stephan Pfannerer, Jessica Striker and Joshua P. Swanson. **An SL_4-web basis from hourglass plabic graphs**.

● Babak Ghanbari and Robert Šámal. **Approximate cycle double cover**.

● Ranveer Singh, Hitesh Wankhede and Ravindra B. Bapat. **Computing the permanental polynomial of 4k-intercyclic bipartite graphs**.

● Robert Lukoťka, Edita Máčajová and Jozef Rajník. **Cyclic connectivity of cages**.

● Tomoki Nakamigawa. **Even-odd Increasing Trees and Expansion of a Chord Diagram**.

● Narmina Baghirova, Clément Dallard, Bernard Ries and David Schindl. **Finding k-community structures in special graph classes**.

● Marshall Yang, Carl Yerger and Daniel Zhou. **Lollipop and Cubic Weight Functions for Graph Pebbling**.

● Andrea de Las Heras Parrilla, Merce Claverol, David Flores-Peñaloza, Clemens Huemer and David Orden. **On Voronoi polynomials and crossing numbers**.

● Vašek Chvátal, Guillermo Andres Gamboa Quintero and Ida Kantor. **Sparse metric hypergraphs**.

● Dibyayan Chakraborty, L. Sunil Chandran, Dalu Jacob and Raji R.Pillai. **chi-binding functions for squares of bipartite graphs and its subclasses**.

● Sandip Das, Koushik Kumar Dey, Pavan P D and Sagnik Sen. **Counting the minimum number of arcs in an oriented graph having weak diameter $2$**.

● Monu Kadyan and Bikash Bhattacharjya. **H-integral and Gaussian integral normal mixed Cayley graphs**.

● Cyril Gavoille and Claire Hilaire. **Minor-Universal Graph for Graphs on Surfaces**.

● Susobhan Bandopadhyay, Soumen Nandi, Sagnik Sen and S Taruni. **Proving the conjecture on $(n,m)$-absolute clique number of planar graphs**.

● Daniel Iľkovič. **Quasirandomness of tournaments via 12-cycles**.

● Benjamin Bergougnoux, Jakub Gajarský, Filip Pokrývka and Marek Sokołowski. **Simple proofs on the structural properties on graphs of twin-width one**.

● Dániel Gerbner and Hilal Hama Karim. **Stability from graph symmetrization arguments in generalized Turán problems**.

● Andrzej Grzesik, Justyna Jaworska, Bartłomiej Kielak, Aliaksandra Novik and Tomasz Ślusarczyk. **Turán problems for oriented graphs**.

**Scientific program**: eurocomb23@iuuk.mff.cuni.cz

**Registration (Milena Zeithamlová)**: milena@action-m.com