Published: 2019-09-02

EUROCOMB 2019

Preface

361-362

PDF

Coloring hypergraphs defined by stabbed pseudo-disks and ABAB-free hypergraphs

Eyal Ackerman, Balazs Keszegh, Dömötör Pálvölgyi

363-370

PDF

Majority coloring of infinite digraphs

Marcin Anholcer, Bartłomiej Bosek, Jarosław Grytczuk

371-376

PDF

Homomorphism-homogeneity classes of countable L-colored graphs

Andrés Aranda, David Hartman

377-382

PDF

MB-Homogeneous graphs and some new HH-homogeneous graphs

Andrés Aranda, David Hartman

383-387

PDF

Localised codegree conditions for tight Hamiltonian cycles in 3-uniform hypergraphs

Pedro Araújo, Simon Piga, Mathias Schacht

389-394

PDF

Pop-stack sorting and its image: Permutations with overlapping runs

Andrei Asinowski, Cyril Banderier, Sara Billey, Benjamin Hackl, Svante Linusson

395-402

PDF

Maximal edge-colorings of graphs

Sebastian Babiński, Andrzej Grzesik

403-407

PDF

Edge-ordered Ramsey numbers

Martin Balko, Máté Vizer

409-414

PDF

Big Ramsey degrees of 3-uniform hypergraphs

Martin Balko, David Chodounský, Jan Hubička, Matěj Konečný, Lluis Vena

415-422

PDF

Maximum induced subgraphs of the binomial random graph

Jozsef Balogh, Maksim Zhukovskii

423-427

PDF

An improved upper bound on the growth constant of polyiamonds

Gill Barequet, Guenter Rote, Mira Shalah

429-436

PDF

Exploring projective norm graphs

Tomas Bayer, Tamás Mészáros, Lajos Rónyai, Tibor Szabó

437-441

PDF

On Heilbronn triangle-type problems in higher dimensions

Fabricio Siqueira Benevides, Carlos Hoppen, Hanno Lefmann, Knut Odermann

443-450

PDF

The size-Ramsey number of powers of bounded degree trees

Sören Berger, Yoshiharu Kohayakawa, Giulia Satiko Maesaka, Taísa Martins, Walner Mendonça, Guilherme Oliveira Mota, Olaf Parczyk

451-456

PDF

Embedding trees with maximum and minimum degree conditions

Guido Besomi, Matías Pavez-Signé, Maya Stein

457-462

PDF

Sharp bounds for decomposing graphs into edges and triangles

Adam Blumenthal, Bernard Lidický, Oleg Pikhurko, Yanitsa Pehova, Florian Pfender, Jan Volec

463-468

PDF

Epsilon-colorings of strips

Felix Bock

469-473

PDF

On relaxed Šoltés's problem

Jan Bok, Nikola Jedličková, Jana Maxová

475-480

PDF

Most principal permutation classes, and t-stack sortable permutations, have nonrational generating functions

Miklós Bóna

481-487

PDF

Asymptotically good local list edge colourings

Marthe Bonamy, Michelle Delcourt, Richard Lang, Luke Postle

489-494

PDF

Maximum number of triangle-free edge colourings with five and six colours

Fábio Botler, Jan Corsten, Attila János Dankovics, Nóra Frankl, Hiệp Hàn, Andrea Jiménez, Jozef Skokan

495-499

PDF

Gallai's path decomposition conjecture for graphs with maximum E-degree at most 3

Fábio Botler, Maycon Sambinelli

501-505

PDF

Bounding the cop number of a graph by its genus

Nathan Bowler, Joshua Erde, Florian Lehner, Max Pitz

507-510

PDF

Nearly orthogonal vectors and small antipodal spherical codes

Boris Bukh, Chris Cox

511-514

PDF

Bounding the tripartite-circle crossing number of complete tripartite graphs

Charles Anthony Camacho, Silvia Fernández-Merchant, Rachel Kirsch, Linda Kleist, Elizabeth Bailey Matson, Marija Jelić Milutinović, Jennifer White

515-520

PDF

A step towards the 3k-4 conjecture in Z/pZ and an application to m-sum-free sets

Pablo Candela, Diego González-Sánchez, David Joseph Grynkiewicz

521-525

PDF

Recent developments on unavoidable patterns in 2-colorings of the complete graph

Yair Caro, Adriana Hansberg, Amanda Montejano

527-532

PDF

Cycles of length three and four in tournaments

Timothy Fong Nam Chan, Andrzej Grzesik, Daniel Kráľ, Jonathan Andrew Noel

533-539

PDF

On 2-factors with a specified number of components in line graphs

Shuya Chiba, Yoshimi Egawa, Jun Fujisawa, Akira Saito, Ingo Schiermeyer, Masao Tsugaki, Tomoki Yamashita

541-546

PDF

Resilience with respect to Hamiltonicity in random graphs

Padraig Condon, Alberto Espuny Díaz, António Girão, Jaehoon Kim, Daniela Kühn, Deryk Osthus

547-551

PDF

Cohomology groups of non-uniform random simplicial complexes

Oliver Cooley, Nicola Del Giudice, Mihyun Kang, Philipp Sprüssel

553-560

PDF

Tiling edge-coloured graphs with few monochromatic bounded-degree graphs

Jan Corsten, Walner Mendonça

561-566

PDF

On the largest component of the critical random digraph

Matthew Coulson

567-572

PDF

Edge-coloring of plane graphs with many colors on faces

Julius Czap, Stanislav Jendroľ, Juraj Valiska

573-576

PDF

Tree pivot-minors and linear rank-width

Konrad K. Dabrowski, François Dross, Jisu Jeong, Mamadou Moustapha Kanté, O-joung Kwon, Sang-il Oum, Daniël Paulusma

577-583

PDF

Independent transversals versus transversals

Konrad K. Dabrowski, Matthew Johnson, Giacomo Paesani, Daniël Paulusma, Viktor Zamaraev

585-591

PDF

Spectra and eigenspaces of arbitrary lifts of graphs

Cristina Dalfó Simó, Miquel Àngel Fiol Mora, Soňa Pavlíková, Jozef Širáň

593-600

PDF

Adaptive majority problems for restricted query graphs and for weighted sets

Gábor Damásdi, Dániel Gerbner, Gyula O. H. Katona, Abhishek Methuku, Balázs Keszegh, Dániel Lenger, Dániel T. Nagy, Dömötör Pálvölgyi, Balázs Patkós, Máté Vizer, Gábor Wiener

601-609

PDF

On orthogonal symmetric chain decompositions

Karl Däubel, Sven Jäger, Torsten Mütze, Manfred Scheucher

611-618

PDF

Edge colorings avoiding patterns

Michał Karol Dębski

619-623

PDF

A Turán-type theorem for large-distance graphs in Euclidean spaces, and related isodiametric problems

Martin Doležal, Jan Hladký, Jan Kolář, Themis Mitsis, Christos Pelekis, Václav Vlasák

625-629

PDF

The evolution of random graphs on surfaces of non-constant genus

Chris Dowden, Mihyun Kang, Michael Moßhammer, Philipp Sprüssel

631-636

PDF

Powers of Hamiltonian cycles in mu-inseparable graphs

Oliver Ebsen, Giulia Satiko Maesaka, Christian Reiher, Mathias Schacht, Bjarne Schülke

637-641

PDF

A rainbow blow-up lemma for almost optimally bounded edge-colourings

Stefan Ehard, Stefan Glock, Felix Joos

643-649

PDF

Recognising the overlap graphs of subtrees of restricted trees is hard

Jessica Enright, Martin Pergel

651-658

PDF

Mixing time of the swap Markov chain and P-stability

Péter L. Erdős, Catherine S. Greenhill, Tamás Róbert Mezei, István Miklós, Dániel Soltész, Lajos Soukup

659-665

PDF

Reconfiguration graph for vertex colourings of weakly chordal graphs

Carl Feghali, Jiří Fiala

667-671

PDF

A note on covering Young diagrams with applications to local dimension of posets

Stefan Felsner, Torsten Ueckerdt

673-678

PDF

Deviation probabilities for arithmetic progressions and other regular discrete structures

Gonzalo Fiz Pontiveros, Simon Griffiths, Matheus Secco, Oriol Serra

679-683

PDF

Doubly biased Walker-Breaker games

Jovana Forcan, Mirjana Mikalački

685-688

PDF

Nearly k-distance sets

Nora Frankl, Andrey Kupavskii

689-693

PDF

Some results around the Erdős Matching Conjecture

Peter Frankl, Andrey Kupavskii

695-699

PDF

Bijections for generalized Tamari intervals via orientations

Éric Fusy, Abel Humbert

701-708

PDF

Theory of limits of sequences of Latin squares

Frederik Garbe, Robert Hancock, Jan Hladký, Maryam Sharifzadeh

709-716

PDF

Edge ordered Turán problems

Dániel Gerbner, Abhishek Methuku, Dániel T. Nagy, Dömötör Pálvölgyi, Gábor Tardos, Máté Vizer

717-722

PDF

Generalized Turán problems for even cycles

Dániel Gerbner, Ervin Győri, Abhishek Methuku, Máté Vizer

723-728

PDF

Degree conditions forcing oriented cycles

Roman Glebov, Andrzej Grzesik, Jan Volec

729-733

PDF

Resolution of the Oberwolfach problem

Stefan Glock, Felix Joos, Jaehoon Kim, Daniela Kühn, Deryk Osthus

735-741

PDF

Guarding isometric subgraphs and Lazy Cops and Robbers

Sebastian Gonzalez Hermosillo de la Maza, Bojan Mohar

743-747

PDF

The canonical Tutte polynomial for signed graphs

Andrew Goodall, Bart Litjens, Guus Regts, Lluís Vena

749-754

PDF

On the maximum number of odd cycles in graphs without smaller odd cycles

Andrzej Grzesik, Bartłomiej Kielak

755-758

PDF

A graphon perspective for fractional isomorphism

Jan Grebík, Israel Rocha

759-765

PDF

The structure of hypergraphs without long Berge cycles

Ervin Győri, Nathan Lemons, Nika Salia, Oscar Zamora

767-771

PDF

The maximum number of P_l copies in P_k-free graphs

Ervin Győri, Nika Salia, Casey Tompkins, Oscar Zamora

773-778

PDF

On some extremal results for order types

Jie Han, Yoshiharu Kohayakawa, Marcelo Tadeu Sales, Henrique Stagni

779-785

PDF

On the achievable average degrees in 2-crossing-critical graphs

Petr Hliněný, Michal Korbela

787-793

PDF

Minimum degree conditions for powers of cycles and paths

Eng Keat Hng

795-800

PDF

Ramsey properties of edge-labelled graphs via completions

Jan Hubička, Matěj Konečný, Jaroslav Nešetřil

801-805

PDF

Extending partial automorphisms of n-partite tournaments

Jan Hubička, Colin Jahel, Matěj Konečný, Marcin Sabok

807-811

PDF

Density and fractal property of the class of oriented trees

Jan Hubička, Jaroslav Nešetřil, Pablo Oviedo

813-818

PDF

More non-bipartite forcing pairs

Tamás Hubai, Daniel Kráľ, Olaf Parczyk, Yury Person

819-825

PDF

Dushnik-Miller dimension of stair contact complexes

Lucas Isenmann, Daniel Gonçalves

827-834

PDF

k-Hypergraphs with regular automorphism groups

Robert Jajcay, Tatiana Baginová Jajcayová

835-840

PDF

Automorphism groups of edge-transitive maps

Gareth A. Jones

841-847

PDF

Two values of the chromatic number of a sparse random graph

Stepan Kargaltsev, Dmitry Shabanov, Talia Shaikheeva

849-854

PDF

A new lower bound on Hadwiger-Debrunner numbers in the plane

Chaya Keller, Shakhar Smorodinsky

855-860

PDF

Sharp bounds for the chromatic number of random Kneser graphs

Sergei Kiselev, Andrey Kupavskii

861-865

PDF

On the Graovac-Pisanski index of a graph

Martin Knor, Riste Škrekovski, Aleksandra Tepeh

867-870

PDF

Covering 3-coloured random graphs with monochromatic trees

Yoshiharu Kohayakawa, Walner Mendonça, Guilherme Mota, Bjarne Schülke

871-875

PDF

Flow number and circular flow number of signed cubic graphs

Anna Kompišová, Edita Máčajová

877-883

PDF

Enumeration of unsensed orientable and non-orientable maps

Evgeniy Krasko, Aleksandr Omelchenko

885-890

PDF

Characterization of generalised Petersen graphs that are Kronecker covers

Matjaž Krnc, Tomaž Pisanski

891-895

PDF

Ramsey upper density of infinite graphs

Ander Lamaison

897-901

PDF

Minor-obstructions for apex sub-unicyclic graphs

Alexandros Leivaditis, Alexandros Singh, Giannos Stamoulis, Dimitrios M. Thilikos, Konstantinos Tsatsanis, Vasiliki Velona

903-910

PDF

Coset geometries with trialities and their reduced incidence graphs

Dimitri Leemans, Klara Stokes

911-916

PDF

Asymmetric Ramsey properties of random graphs involving cliques and cycles

Anita Liebenau, Letícia Mattos, Walner Mendonça, Jozef Skokan

917-922

PDF

Distinguishing tournaments with small label classes

Antoni Lozano

923-928

PDF

Permutation snarks of order 2 (mod 8)

Edita Máčajová, Martin Škoviera

929-934

PDF

Flexibility of planar graphs without 4-cycles

Tomáš Masařík

935-940

PDF

Colouring non-even digraphs

Marcelo Garlet Millani, Raphael Steiner, Sebastian Wiederrecht

941-945

PDF

Splitting groups with cubic Cayley graphs of connectivity two

Babak Miraftab, Konstantinos Stavropoulos

947-954

PDF

The asymptotics of reflectable weighted walks in arbitrary dimension

Marni Mishna, Sam Simon

955-962

PDF

Cycles through a set of specified vertices of a planar graph

Samuel Mohr

963-966

PDF

On unit grid intersection graphs and several other intersection graph classes

Irina Mustaţă, Martin Pergel

967-972

PDF

Testing isomorphism of circulant objects in polynomial time

Mikhail Muzychuk, Ilia Ponomarenko

973-975

PDF

Spreading linear triple systems and expander triple systems

Zoltán Lóránt Nagy, Zoltán L. Blázsik

977-984

PDF

Ordered graphs and large bi-cliques in intersection graphs of curves

János Pach, István Tomon

985-988

PDF

Symbolic method and directed graph enumeration

Élie de Panafieu, Sergey Dovgal

989-996

PDF

Almost spanning universality in random graphs

Olaf Parczyk

997-1002

PDF

A Brooks-like result for graph powers

Théo Pierron

1003-1007

PDF

On the density of C7-critical graphs

Luke Postle, Evelyne Smith-Roberge

1009-1016

PDF

The Kuperberg conjecture for translates of convex bodies

Roman Prosanov

1017-1021

PDF

Minimum pair-degee for tight Hamiltonian cycles in 4-uniform hypergraphs

Christian Reiher, Vojtěch Rödl, Andrzej Ruciński, Mathias Schacht, Bjarne Schülke

1023-1027

PDF

On a Frankl-Wilson theorem and its geometric corollaries

Arsenii A. Sagdeev, Andrei M. Raigorodskii

1029-1033

PDF

Ramsey numbers of Berge-hypergraphs and related structures

Nika Salia, Casey Tompkins, Zhiyu Wang, Oscar Alonso Zamora Luna

1035-1042

PDF

Extremal families for Kruskal-Katona Theorem

Oriol Serra, Lluis Vena Cros

1043-1048

PDF

On disjoint holes in point sets

Manfred Scheucher

1049-1056

PDF

t-Strong cliques and the degree-diameter problem

Małgorzata Śleszyńska-Nowak, Michał Dębski

1057-1061

PDF

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

Bartosz Walczak

1063-1069

PDF

On the chromatic index of complementary prisms

Leandro Miranda Zatesko, Renato Carmo, André L. P. Guedes, Alesom Zorzi, Raphael C. S. Machado, Celina M. H. Figueiredo

1071-1077

PDF

Target set in threshold models

Ahad N. Zehmakan

1079-1086

PDF

Switches in Eulerian graphs

Ahad N. Zehmakan, Jerri Nummenpalo, Alexander Pilz, Daniel Wolleb-Graf

1087-1092

PDF

Length of cycles in generalized Petersen graphs

Zanbo Zhang, Zhaojun Chen

1093-1100

PDF