Published: 2019-09-02

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

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

363-370

Majority coloring of infinite digraphs

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

371-376

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

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

395-402

Maximal edge-colorings of graphs

Sebastian Babiński, Andrzej Grzesik

403-407

Edge-ordered Ramsey numbers

Martin Balko, Máté Vizer

409-414

Big Ramsey degrees of 3-uniform hypergraphs

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

415-422

An improved upper bound on the growth constant of polyiamonds

Gill Barequet, Guenter Rote, Mira Shalah

429-436

Exploring projective norm graphs

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

437-441

On Heilbronn triangle-type problems in higher dimensions

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

443-450

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

Embedding trees with maximum and minimum degree conditions

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

457-462

Sharp bounds for decomposing graphs into edges and triangles

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

463-468

On relaxed Šoltés's problem

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

475-480

Asymptotically good local list edge colourings

Marthe Bonamy, Michelle Delcourt, Richard Lang, Luke Postle

489-494

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

Bounding the cop number of a graph by its genus

Nathan Bowler, Joshua Erde, Florian Lehner, Max Pitz

507-510

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

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

Cycles of length three and four in tournaments

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

533-539

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

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

Cohomology groups of non-uniform random simplicial complexes

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

553-560

Edge-coloring of plane graphs with many colors on faces

Julius Czap, Stanislav Jendroľ, Juraj Valiska

573-576

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

Independent transversals versus transversals

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

585-591

Spectra and eigenspaces of arbitrary lifts of graphs

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

593-600

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

On orthogonal symmetric chain decompositions

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

611-618

Edge colorings avoiding patterns

Michał Karol Dębski

619-623

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

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

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

631-636

Powers of Hamiltonian cycles in mu-inseparable graphs

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

637-641

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

Deviation probabilities for arithmetic progressions and other regular discrete structures

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

679-683

Doubly biased Walker-Breaker games

Jovana Forcan, Mirjana Mikalački

685-688

Nearly k-distance sets

Nora Frankl, Andrey Kupavskii

689-693

Some results around the Erdős Matching Conjecture

Peter Frankl, Andrey Kupavskii

695-699

Theory of limits of sequences of Latin squares

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

709-716

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

Generalized Turán problems for even cycles

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

723-728

Degree conditions forcing oriented cycles

Roman Glebov, Andrzej Grzesik, Jan Volec

729-733

Resolution of the Oberwolfach problem

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

735-741

Guarding isometric subgraphs and Lazy Cops and Robbers

Sebastian Gonzalez Hermosillo de la Maza, Bojan Mohar

743-747

The canonical Tutte polynomial for signed graphs

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

749-754

The structure of hypergraphs without long Berge cycles

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

767-771

The maximum number of P_l copies in P_k-free graphs

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

773-778

On some extremal results for order types

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

779-785

Ramsey properties of edge-labelled graphs via completions

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

801-805

Extending partial automorphisms of n-partite tournaments

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

807-811

Density and fractal property of the class of oriented trees

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

813-818

More non-bipartite forcing pairs

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

819-825

Dushnik-Miller dimension of stair contact complexes

Lucas Isenmann, Daniel Gonçalves

827-834

k-Hypergraphs with regular automorphism groups

Robert Jajcay, Tatiana Baginová Jajcayová

835-840

Two values of the chromatic number of a sparse random graph

Stepan Kargaltsev, Dmitry Shabanov, Talia Shaikheeva

849-854

On the Graovac-Pisanski index of a graph

Martin Knor, Riste Škrekovski, Aleksandra Tepeh

867-870

Covering 3-coloured random graphs with monochromatic trees

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

871-875

Enumeration of unsensed orientable and non-orientable maps

Evgeniy Krasko, Aleksandr Omelchenko

885-890

Minor-obstructions for apex sub-unicyclic graphs

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

903-910

Asymmetric Ramsey properties of random graphs involving cliques and cycles

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

917-922

Permutation snarks of order 2 (mod 8)

Edita Máčajová, Martin Škoviera

929-934

Colouring non-even digraphs

Marcelo Garlet Millani, Raphael Steiner, Sebastian Wiederrecht

941-945

Splitting groups with cubic Cayley graphs of connectivity two

Babak Miraftab, Konstantinos Stavropoulos

947-954

Spreading linear triple systems and expander triple systems

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

977-984

Symbolic method and directed graph enumeration

Élie de Panafieu, Sergey Dovgal

989-996

On the density of C7-critical graphs

Luke Postle, Evelyne Smith-Roberge

1009-1016

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

On a Frankl-Wilson theorem and its geometric corollaries

Arsenii A. Sagdeev, Andrei M. Raigorodskii

1029-1033

Ramsey numbers of Berge-hypergraphs and related structures

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

1035-1042

Extremal families for Kruskal-Katona Theorem

Oriol Serra, Lluis Vena Cros

1043-1048

On disjoint holes in point sets

Manfred Scheucher

1049-1056

t-Strong cliques and the degree-diameter problem

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

1057-1061

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

Target set in threshold models

Ahad N. Zehmakan

1079-1086

Switches in Eulerian graphs

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

1087-1092