EUROCOMB 2019 Accepted Papers

Carl Feghali and Jiri Fiala. Reconfiguration Graph for Vertex Colourings of Weakly Chordal Graphs

Karl Däubel, Sven Jäger, Torsten Mütze and Manfred Scheucher. On orthogonal symmetric chain decompositions

Gareth Jones. Automorphism groups of edge-transitive maps

Tomáš Masařík. Flexibility of planar graphs without 4-cycles

Timothy Chan, Andrzej Grzesik, Dan Kral and Jonathan Noel. Cycles of length three and four in tournaments

Martin Knor, Riste Skrekovski and Aleksandra Tepeh. On Graovac-Pisanski index of a graph

Miklos Bona. Most Principal Permutation Classes, and t-stack Sortable permutations, Have Nonrational Generating Functions

Ahad N. Zehmakan, Jerri Nummenpalo, Alexander Pilz and Daniel Wolleb-Graf. Switches in Eulerian graphs

Chris Dowden, Mihyun Kang, Michael Mosshammer and Philipp Sprüssel. The evolution of random graphs on surfaces of non-constant genus

Leandro M. Zatesko, Renato Carmo, André L. P. Guedes, Alesom Zorzi, Raphael C. S. Machado and Celina M. H. Figueiredo. On the Chromatic Index of Complementary Prisms

Petr Hlineny and Michal Korbela. On the achievable average degrees in 2-crossing-critical graphs

Gill Barequet, Günter Rote and Mira Shalah. An Improved Upper Bound on the Growth Constant of Polyiamonds

Marcelo Garlet Millani, Raphael Steiner and Sebastian Wiederrecht. Colouring Non-Even Digraphs

Olaf Parczyk. Almost spanning universality in random graphs

Adam Blumenthal, Bernard Lidický, Oleg Pikhurko, Yani Pehova, Florian Pfender and Jan Volec. Sharp bounds for decomposing graphs into edges and triangles

Jovana Forcan and Mirjana Mikalački. Doubly biased Walker-Breaker games

Pablo Candela, Diego Gonzalez-Sanchez and David Grynkiewicz. A step towards the 3k-4 conjecture in Z/pZ and an application to m-sum-free sets

Peter Frankl and Andrey Kupavskii. Some results on the Erdos Matching Conjecture

Roman Prosanov. The Kuperberg conjecture for translates of convex bodies

Cristina Dalfó, Miquel Àngel Fiol, Sona Pavlíková and Jozef Sirán. Spectra and eigenspaces of arbitrary lifts of graphs

Janos Pach and Istvan Tomon. Ordered graphs and large bi-cliques in intersection graphs of curves

Stefan Glock, Felix Joos, Jaehoon Kim, Daniela Kühn and Deryk Osthus. Resolution of the Oberwolfach problem - extended abstract

Alberto Espuny Díaz, António Girão, Padraig Condon, Jaehoon Kim, Daniela Kühn and Deryk Osthus. Resilience with respect to Hamiltonicity in random graphs

Stefan Felsner and Torsten Ueckerdt. A Note on Covering Young Diagrams with Applications to Local Dimension of Posets

Irina Mustata and Martin Pergel. On Unit Grid Intersection Graphs and What Makes the Recognition Problem Hard for Some Classes of Intersection Graphs

Jessica Enright and Martin Pergel. Recognising the Overlap Graphs of Subtrees of Restricted Trees is Hard

Ervin Győri, Nathan Lemons, Nika Salia and Oscar Zamora. The Structure of Hypergraphs without long Berge cycles

Aleksandr Omelchenko and Evgeniy Krasko. Enumeration of Unsensed Orientable and Non-Orientable Maps

Eyal Ackerman, Balázs Keszegh and Dömötör Pálvölgyi. Coloring hypergraphs defined by stabbed pseudo-disks and ABAB-free hypergraphs

Mikhail Muzychuk and Ilia Ponomarenko. Testing isomorphism of circulant objects in polynomial time

Chaya Keller and Shakhar Smorodinsky. A New Lower Bound on Hadwiger-Debrunner Numbers in the Plane

Konrad K. Dabrowski, Matthew Johnson, Giacomo Paesani, Daniel Paulusma and Viktor Zamaraev. Independent Transversals versus Transversals

Oriol Serra and Lluís Vena. Extremal Families for Kruskal-Katona Theorem

Martin Balko, David Chodounský, Jan Hubička, Matěj Konečný and Lluis Vena. Big Ramsey degrees of 3-uniform hypergraphs

Andre Raspaud and Min Chen. Acyclic improper choosability of subcubic graphs

Ahad N. Zehmakan. Target Set in Threshold Models

Ander Lamaison. Ramsey upper density of infinite graphs

Oliver Cooley, Nicola Del Giudice, Mihyun Kang and Philipp Sprüssel. Cohomology groups of non-uniform random simplicial complexes

Christopher Cox and Boris Bukh. Nearly orthogonal vectors and small antipodal spherical codes

Jan Hubička, Colin Jahel, Matěj Konečný and Marcin Sabok. Extending partial automorphisms of n-partite tournaments

Jan Hubička, Jaroslav Nešetřil and Pablo Oviedo. Density and Fractal Property of the Class of Oriented Trees

Tamás Hubai, Dan Král', Olaf Parczyk and Yury Person. More non-bipartite forcing pairs

Marthe Bonamy, Michelle Delcourt, Richard Lang and Luke Postle. Asymptotically good Local list edge colourings

Stepan Kargaltsev, Dmitry Shabanov and Talia Shaikheeva. Two values of the chromatic number of a sparse random graph

Arsenii Sagdeev and Andrei Raigorodskii. On a Frankl--Wilson theorem and its geometric corollaries

Martin Balko and Máté Vizer. Edge-ordered Ramsey numbers

Luke Postle and Evelyne Smith-Roberge. On the Density of C_7-Critical Graphs

Martin Dolezal, Jan Hladky, Jan Kolar, Themis Mitsis, Christos Pelekis and Vaclav Vlasak. A Turan-type theorem for large-distance graphs in Euclidean spaces, and related isodiametric problems (extended abstract)

Eng Keat Hng. Powers of cycles and paths

Jan Hubička, Matěj Konečný and Jaroslav Nešetřil. Ramsey properties of edge-labelled graphs via completions

Stefan Ehard, Stefan Glock and Felix Joos. A rainbow blow-up lemma for almost optimally bounded edge-colourings - Extended abstract

Shuya Chiba, Yoshimi Egawa, Jun Fujisawa, Akira Saito, Ingo Schiermeyer, Masao Tsugaki and Tomoki Yamashita. On 2-factors with a specified number of components in line graphs

Nika Salia, Casey Tompkins, Zhiyu Wang and Oscar Zamora Luna. Ramsey numbers of Berge-hypergraphs and related structures

Dániel Gerbner, Abhishek Methuku, Dániel T. Nagy, Dömötör Pálvölgyi, Gábor Tardos and Máté Vizer. Edge ordered Turán problems

Joshua Erde, Nathan Bowler, Florian Lehner and Max Pitz. Bounding the cop number of a graph by its genus

Dániel Gerbner, Ervin Győri, Abhishek Methuku and Máté Vizer. Generalized Tur\'an problems for even cycles

David Hartman and Andres Aranda. Homomorphism-homogeneity classes of countable L-colored graphs

Matthew Coulson. On the largest component of the critical random digraph

Frederik Garbe, Robert Hancock, Jan Hladký and Maryam Sharifzadeh. Theory of limits of sequences of Latin squares

Eric Fusy and Abel Humbert. Bijections for generalized Tamari intervals via orientations

Alexandros Leivaditis, Alexandros Singh, Giannos Stamoulis, Dimitrios Thilikos, Konstantinos Tsatsanis and Vasiliki Velona. Minor-Obstructions for Apex Sub-unicyclic Graphs

Gábor Damásdi, Daniel Gerbner, Gyula O.H. Katona, Balázs Keszegh, Dániel Lenger, Abhishek Methuku, Daniel Nagy, Dömötör Pálvölgyi, Balazs Patkos, Mate Vizer and Gabor Wiener. Adaptive Majority Problems for Restricted Query Graphs and for Weighted Sets

Tamás Róbert Mezei, Péter L. Erdős, István Miklós, Dániel Soltész, Lajos Soukup and Catherine Greenhill. Mixing time of the swap Markov chain and $P$-stability

Yiting Jiang and Xuding Zhu. Multiple list colouring of triangle free planar graphs

Zan-Bo Zhang and Zhaojun Chen. Length of Cycles in Generalized Petersen Graphs

Bartłomiej Kielak and Andrzej Grzesik. On the maximum number of odd cycles in graphs without smaller odd cycles

Zdenek Dvorak and Jakub Pekárek. On graphs with bounded induced odd cycle packing number

Nora Frankl and Andrey Kupavskii. Nearly k-distance sets

Tomas Bayer, Tamás Mészáros, Lajos Rónyai and Tibor Szabó. Exploring projective norm graphs

Jan Corsten and Walner Mendonça. Tiling edge-coloured graphs with few monochromatic bounded-degree graphs

Jozsef Balogh and Maksim Zhukovskii. Maximum induced subgraphs of the binomial random graph

Fábio Botler and Maycon Sambinelli. Gallai's path decomposition conjecture for graphs with maximum E-degree at most 3

Sergei Kiselev and Andrey Kupavskii. Sharp bounds for the chromatic number of random Kneser graphs

Charles Camacho, Silvia Fernandez-Merchant, Rachel Kirsch, Linda Kleist, Elizabeth Matson, Marija Jelic Milutinovic and Jennifer White. Bounding the tripartite-circle crossing number of complete tripartite graphs

Stanislav Jendrol. Edge-coloring of plane graphs with many colors on faces

Michał Dębski. Edge colorings avoiding patterns

Israel Rocha and Jan Grebík. A graphon perspective for fractional isomorphism

Anna Kompišová and Edita Máčajová. Flow number and circular flow number of signed cubic graphs

Jie Han, Yoshiharu Kohayakawa, Marcelo Sales and Henrique Stagni. On some extremal results for order types

Bartosz Walczak. Coloring triangle-free L-graphs with O(log log n) colors

Robert Jajcay and Tatiana Jajcayova. $k$-HYPERGRAPHS WITH REGULAR AUTOMORPHISM GROUPS

Sebastian Babiński and Andrzej Grzesik. MAXIMAL EDGE-COLORINGS OF GRAPHS

Théo Pierron. A Brooks-like result for graph powers

Konrad K. Dabrowski, François Dross, Jisu Jeong, Mamadou Moustapha Kanté, O-Joung Kwon, Sang-Il Oum and Daniel Paulusma. Tree Pivot-Minors and Linear Rank-Width

Roman Glebov, Andrzej Grzesik and Jan Volec. Degree conditions forcing oriented cycles

Sebastian Gonzalez Hermosillo de la Maza and Bojan Mohar. Guarding isometric subgraphs and Lazy Cops and Robbers

Adriana Hansberg, Yair Caro and Amanda Montejano. Recent developments on unavoidable patterns in $2$-colorings of the complete graph

Élie de Panafieu and Sergey Dovgal. Symbolic method and directed graph enumeration

Samuel Mohr. Cycles through a set of specified vertices of a planar graph

Matjaž Krnc and Tomaž Pisanski. Characterization of generalised Petersen graphs that are Kronecker covers

Andres Aranda and David Hartman. MB-homogeneous graphs and some new HH-homogeneous graphs.

Pedro Araújo, Simon Piga and Mathias Schacht. Localised codegree conditions for tight Hamiltonian cycles in 3-uniform hypergraphs

Andrew Goodall, Lluis Vena, Bart Litjens and Guus Regts. The canonical Tutte polynomial for signed graphs

Zoltán Lóránt Nagy and Zoltán Blázsik. Spreading linear triple systems and expander triple systems

Klara Stokes and Dimitri Leemans. Coset geometries with trialities and their reduced incidence graphs

Babak Miraftab and Konstantinos Stavropoulos. Splitting groups with cubic Cayley graphs of connectivity two

Lucas Isenmann and Daniel Gonçalves. Dushnik-Miller dimension of stair contact complexes

Felix Bock. $\epsilon$-colorings of strips

Fábio Botler, Jan Corsten, Attila Dankovics, Nóra Frankl, Hiep Hàn, Andrea Jiménez and Jozef Skokan. Maximum number of triangle-free edge colourings with five and six colours

Antoni Lozano. Distinguishing Tournaments with Small Label Classes

Christian Reiher, Vojtěch Rödl, Andrzej Ruciński, Mathias Schacht, Bjarne Schülke and Endre Szemerédi. Minimum pair-degree for tight Hamiltonian cycles in 4-uniform hypergraphs

Jarosław Grytczuk, Marcin Anholcer and Bartłomiej Bosek. Majority Coloring of Infinite Digraphs

Matias Pavez-Signé, Guido Besomi and Maya Stein. Embedding trees with maximum and minimum degree conditions

Oliver Ebsen, Giulia Satiko Maesaka, Christian Reiher, Mathias Schacht and Bjarne Schülke. Powers of Hamiltonian cycles in inseparable graphs

Gonzalo Fiz Pontiveros, Simon Griffiths, Matheus Secco and Oriol Serra. DEVIATION PROBABILITIES FOR ARITHMETIC PROGRESSIONS AND OTHER REGULAR DISCRETE STRUCTURES

Sören Berger, Yoshiharu Kohayakawa, Giulia Satiko Maesaka, Taísa Martins, Walner Mendonça, Guilherme Oliveira Mota and Olaf Parczyk. THE SIZE-RAMSEY NUMBER OF POWERS OF BOUNDED DEGREE TREES

Knut Odermann, Carlos Hoppen, Hanno Lefmann and Fabricio Benevides. On Heilbronn triangle-type problems in higher dimensions

Ervin Gyori, Nika Salia, Casey Tompkins and Oscar Zamora. The maximum number of $P_\ell$ copies in $P_k$-free graphs

Andrei Asinowski, Cyril Banderier, Sara Billey, Benjamin Hackl and Svante Linusson. Pop-stack sorting and its image: Permutations with overlapping runs

Anita Liebenau, Letícia Mattos, Walner Mendonça and Jozef Skokan. Asymmetric Ramsey Properties of Random Graphs Involving Cliques and Cycles

Yoshiharu Kohayakawa, Walner Mendonça, Guilherme Mota and Bjarne Schülke. Covering 3-coloured random graphs with monochromatic trees

Sam Simon and Marni Mishna. The asymptotics of reflectable weighted walks in arbitrary dimension

Małgorzata Śleszyńska-Nowak and Michał Dębski. t-strong cliques and the degree-diameter problem

Jan Bok, Nikola Jedličková and Jana Maxová. On relaxed Šoltés's problem

Edita Macajova and Martin Skoviera. Permutation snarks of order $2\pmod8$