Extended Abstracts EuroComb 2021 : European Conference on Combinatorics, Graph Theory and Applications PDF
Preview Extended Abstracts EuroComb 2021 : European Conference on Combinatorics, Graph Theory and Applications
Trends in Mathematics Research Perspectives CRM Barcelona Vol.14 Jaroslav Nešetrˇ il Guillem Perarnau Juanjo Rué Oriol Serra Editors Extended Abstracts EuroComb 2021 European Conference on Combinatorics, Graph Theory and Applications Trends in Mathematics Research Perspectives CRM Barcelona Volume 14 Managing Editor David Romero i Sànchez, Centre de Rercerca Matemàtica, Barcelona, Spain Since 1984 the Centre de Recerca Matemàtica (CRM) has been organizing scientific events such as conferences or workshops which span a wide range of cutting-edge topics in mathematics and present outstanding new results. In the fall of 2012, the CRM decided to publish extended conference abstracts originating from scientific events hosted at the center. The aim of this initiative is to quickly communicatenewachievements,contributetoafluentupdateofthestateoftheart, andenhancethescientificbenefitoftheCRMmeetings.Theextendedabstractsare publishedinthesubseriesResearchPerspectivesCRMBarcelonawithintheTrends inMathematicsseries.Volumesinthesubserieswillincludeacollectionofrevised writtenversionsofthecommunications,groupedbyevents.Contributingauthorsto this extended abstracts series remain free to use their own material as in these publicationsforotherpurposes(forexamplearevisedandenlargedpaper)without prior consent from the publisher, provided it is not identical in form and content with the original publication and provided the original source is appropriately credited. More information about this subseries at http://www.springer.com/series/13332 š ř Jaroslav Ne et il Guillem Perarnau (cid:129) (cid:129) é Juanjo Ru Oriol Serra (cid:129) Editors Extended Abstracts EuroComb 2021 European Conference on Combinatorics, Graph Theory and Applications Editors Jaroslav Nešetřil Guillem Perarnau Computer Science Institute Departament deMatemàtiques CharlesUniversity Universitat PolitècnicadeCatalunya Praha, Czech Republic Barcelona,Spain Juanjo Rué Oriol Serra Departament deMatemàtiques Departament deMatemàtiques Universitat PolitècnicadeCatalunya Universitat PolitècnicadeCatalunya Castelldefels, Spain Barcelona,Spain ISSN 2297-0215 ISSN 2297-024X (electronic) Trends inMathematics ISSN 2509-7407 ISSN 2509-7415 (electronic) Research Perspectives CRM Barcelona ISBN978-3-030-83822-5 ISBN978-3-030-83823-2 (eBook) https://doi.org/10.1007/978-3-030-83823-2 ©TheEditor(s)(ifapplicable)andTheAuthor(s),underexclusivelicense toSpringerNatureSwitzerlandAG2021 Thisworkissubjecttocopyright.AllrightsaresolelyandexclusivelylicensedbythePublisher,whether thewholeorpartofthematerialisconcerned,specificallytherightsoftranslation,reprinting,reuseof illustrations, recitation, broadcasting, reproduction on microfilms or in any other physical way, and transmissionorinformationstorageandretrieval,electronicadaptation,computersoftware,orbysimilar ordissimilarmethodologynowknownorhereafterdeveloped. The use of general descriptive names, registered names, trademarks, service marks, etc. in this publicationdoesnotimply,evenintheabsenceofaspecificstatement,thatsuchnamesareexemptfrom therelevantprotectivelawsandregulationsandthereforefreeforgeneraluse. The publisher, the authors and the editors are safe to assume that the advice and information in this book are believed to be true and accurate at the date of publication. Neither the publisher nor the authors or the editors give a warranty, expressed or implied, with respect to the material contained hereinorforanyerrorsoromissionsthatmayhavebeenmade.Thepublisherremainsneutralwithregard tojurisdictionalclaimsinpublishedmapsandinstitutionalaffiliations. This book is published under the imprint Birkhäuser, www.birkhauser-science.com by the registered companySpringerNatureSwitzerlandAG Theregisteredcompanyaddressis:Gewerbestrasse11,6330Cham,Switzerland Preface to the Abstracts Volume of EuroComb21 Thisvolumeincludesthecollectionofextendedabstractsthatwerepresentedatthe European Conference on Combinatorics, Graph Theory and Applications (EUROCOMB’21), held online and organized by Universitat Politècnica de Catalunya from September 6 to September 10, 2021. TheEUROCOMBconferences areorganizedbiannually.Theserieswasstarted in Barcelona 2001 and continued with Prague 2003, Berlin 2005, Seville 2007, Bordeaux 2009, Budapest 2011, Pisa 2013, Bergen 2015, Viena 2017, and Bratislava2019.In2021andforthefirsttimeinhistory,EUROCOMBwillbeheld online due to the worldwide effects of COVID-19. Combinatorics is a central topic in mathematics with countless applications in other disciplines such as theoretical physics, life and social sciences, and engi- neering. Most notably, combinatorial methods have played an essential role in the theoretical analysis of algorithms. This interaction has been recently recognized with the 2021 Abel Prize awarded to Lázlo Lovász and Avi Widgerson for their contributions on discrete mathematics and theoretical computer science. EUROCOMB is the reference European conference in combinatorics and one of the main events worldwide in the area. Since EUROCOMB’03 in Prague, the European Prize in combinatorics is awarded to recognize groundbreaking contri- butions in combinatorics, discrete mathematics, and their applications by young European researchers notolder than 35. It issupported by DIMATIA,by the local organizers and by private sources. EUROCOMB’21 was organized by members of the Universitat Politècnica de Catalunya, Barcelona, Spain. A total of 177 contributions were submitted from which the program committee selected 135 to be presented at the conference. We would like to highlight the excellent quality of most of the submitted abstracts. In addition to the contributed presentations, the conference hosted ten plenary talks delivered by top researchers in the area on a variety of topics in extremal, proba- bilistic and structural combinatorics, and theoretical computer science. – Julia Böttcher (LSE, London) – Josep Díaz (UPC, Barcelona) v vi PrefacetotheAbstractsVolumeofEuroComb21 – Louis Esperet (G-SCOP, Grenoble) – Christian Krattenthaler (U. Wien) – Sergey Norin (McGill, Montreal) – Will Perkins (UIC, Chicago) – Marcin Pilipczuk (U. of Warsaw) – Lisa Sauerman (IAS, Princeton) – Eva Tardos (Cornell, Ithaca) – David Wood (Monash, Melbourne) In this edition, a special session has been organized to honor the memory of Robin Thomas and his contributions to the area. The session included the plenary talk by Sergey Norin and invited talks by Dan Král’, Zdenek Dvořák, and Luke Postle. The program committee members were – Maria Axenovich (KIT, Karlsruhe) – Agnes Backhausz (Eötvös Loránd U., Budapest) – Marthe Bonamy (LABRI, Bordeaux) – Michael Drmota (TUWien) – Zdenek Dvořák (Charles University, Prague) – Stefan Felsner (TU Berlin) – Ervin Gyori (Alfred Rényi Institute, Budapest) – Dan Král’ (Masaryk University, Brno) – Bojan Mohar (SFU, Vancouver and University of Ljubljana) – Rob Morris (IMPA, Rio de Janeiro) – Jaroslav Nešetřil (Charles University and ITI, Prague), Chair – Marc Noy (UPC, Barcelona) – Patrice Ossona de Mendez (CNRS and EHESS, Paris) – Marco Pellegrini (IIT-CNR, Pisa) – Oleg Pikhurko (Warwick) – Andrzej Ruciński (UAM, Póznan and Emory) – Oriol Serra (UPC, Barcelona), Co-chair – Martin Škoviera (Comenius U., Bratislava) – Jozef Skokan (LSE, London) – Maya Stein (U. de Chile, Santiago de Chile) – Benjamin Sudakov (ETH, Zurich) – Xuding Zhu (Zhejiang Normal U., Jinhua) We thank all participants of EUROCOMB’21, all invited speakers, and all membersoftheprogramcommitteefortheirgenerouscommitmenttothescientific success of the conference, especially during challenging times. Jaroslav Nešetřil Guillem Perarnau Juanjo Rué Oriol Serra Contents Size of Local Finite Field Kakeya Sets . . . . . . . . . . . . . . . . . . . . . . . . . . 1 Ghurumuruhan Ganesan Coloring of Graphs Avoiding Bicolored Paths of a Fixed Length . . . . . 5 Alaittin Kırtışoğlu and Lale Özkahya Nested Cycles with No Geometric Crossings . . . . . . . . . . . . . . . . . . . . . 12 Irene Gil Fernández, Jaehoon Kim, Younjin Kim, and Hong Liu Cut Vertices in Random Planar Graphs. . . . . . . . . . . . . . . . . . . . . . . . . 18 Mihyun Kang and Michael Missethan Extremal Density for Sparse Minors and Subdivisions. . . . . . . . . . . . . . 25 John Haslegrave, Jaehoon Kim, and Hong Liu Enumerating Descents on Quasi-Stirling Permutations and Plane Trees . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 32 Sergi Elizalde Hamiltonicity of Randomly Perturbed Graphs. . . . . . . . . . . . . . . . . . . . 38 Alberto Espuny Díaz and António Girão The Largest Hole in Sparse Random Graphs. . . . . . . . . . . . . . . . . . . . . 45 Nemanja Draganić, Stefan Glock, and Michael Krivelevich On 13-Crossing-Critical Graphs with Arbitrarily Large Degrees. . . . . . 50 Petr Hliněný and Michal Korbela Local Convergence of Random Planar Graphs . . . . . . . . . . . . . . . . . . . 57 Benedikt Stufler Some Results on the Laplacian Spectra of Token Graphs . . . . . . . . . . . 64 Cristina Dalfó, Frank Duque, Ruy Fabila-Monroy, Miquel Àngel Fiol, Clemens Huemer, Ana Laura Trujillo-Negrete, and Francisco J. Zaragoza Martínez viii Contents On the Number of Compositions of Two Polycubes. . . . . . . . . . . . . . . . 71 Andrei Asinowski, Gill Barequet, Gil Ben-Shachar, Martha Carolina Osegueda, and Günter Rote Halin’s End Degree Conjecture . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 78 Stefan Geschke, Jan Kurkofka, Ruben Melcher, and Max Pitz Coloring Circle Arrangements: New 4-Chromatic Planar Graphs . . . . . 84 Man-Kwun Chiu, Stefan Felsner, Manfred Scheucher, Felix Schröder, Raphael Steiner, and Birgit Vogtenhuber A Short Proof of Euler–Poincaré Formula. . . . . . . . . . . . . . . . . . . . . . . 92 Petr Hliněný Approximate MDS Property of Linear Codes . . . . . . . . . . . . . . . . . . . . 97 Ghurumuruhan Ganesan A SAT Attack on Higher Dimensional Erdős–Szekeres Numbers . . . . . 103 Manfred Scheucher Improved Bounds on the Cop Number of a Graph Drawn on a Surface. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 111 Joshua Erde and Florian Lehner Stability of Extremal Connected Hypergraphs Avoiding Berge-Paths . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 117 Dániel Gerbner, Dániel T. Nagy, Balázs Patkós, Nika Salia, and Máté Vizer OnTangenciesAmongPlanarCurveswithanApplicationtoColoring L-Shapes . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 123 Eyal Ackerman, Balázs Keszegh, and Dömötör Pálvölgyi Semi-random Process Without Replacement . . . . . . . . . . . . . . . . . . . . . 129 Shoni Gilboa and Dan Hefetz The Intersection Spectrum of 3-Chromatic Intersecting Hypergraphs . . 136 Matija Bucić, Stefan Glock, and Benny Sudakov On Ordered Ramsey Numbers of Tripartite 3-Uniform Hypergraphs. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 142 Martin Balko and Máté Vizer Hypergraphs with Minimum Positive Uniform Turán Density. . . . . . . . 148 Frederik Garbe, Daniel Král’, and Ander Lamaison Rainbow Cliques in Randomly Perturbed Dense Graphs. . . . . . . . . . . . 154 Elad Aigner-Horev, Oran Danon, Dan Hefetz, and Shoham Letzter Contents ix Universal Singular Exponents in Catalytic Variable Equations . . . . . . . 160 Michael Drmota, Marc Noy, and Guan-Ru Yu The Expected Number of Perfect Matchings in Cubic Planar Graphs . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 167 Marc Noy, Clément Requilé, and Juanjo Rué Gallai-Ramsey Number for Complete Graphs . . . . . . . . . . . . . . . . . . . . 175 Colton Magnant and Ingo Schiermeyer On the Dichromatic Number of Surfaces . . . . . . . . . . . . . . . . . . . . . . . . 181 Pierre Aboulker, Frédéric Havet, Kolja Knauer, and Clément Rambaud Supersaturation, Counting, and Randomness in Forbidden Subposet Problems. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 188 Dániel Gerbner, Dániel Nagy, Balázs Patkós, and Máté Vizer Path Decompositions of Tournaments . . . . . . . . . . . . . . . . . . . . . . . . . . 195 AntónioGirão,BertilleGranet,DanielaKühn,AllanLo,andDerykOsthus Sorting by Shuffling Methods and a Queue . . . . . . . . . . . . . . . . . . . . . . 201 Stoyan Dimitrov Circular Coloring of Signed Bipartite Planar Graphs . . . . . . . . . . . . . . 208 Reza Naserasr and Zhouningxin Wang Results on the Graceful Game and Range-Relaxed Graceful Game. . . . 214 D. L. Oliveira, S. Dantas, and Atílio G. Luiz New Bounds on the Modularity of Johnson Graphs and Random Subgraphs of Johnson Graphs . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 221 Nikita Derevyanko, Mikhail Koshelev, and Andrei Raigorodskii On Bipartite Sum Basic Equilibria. . . . . . . . . . . . . . . . . . . . . . . . . . . . . 228 Carme Àlvarez and Arnau Messegué Characterization and Enumeration of Preimages Under the Queuesort Algorithm . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 234 Lapo Cioni and Luca Ferrari On Off-Diagonal Ordered Ramsey Numbers of Nested Matchings. . . . . 241 Martin Balko and Marian Poljak Bounds on Half Graph Orders in Powers of Sparse Graphs . . . . . . . . . 248 Marek Sokołowski The Homotopy Type of the Independence Complex of Graphs with No Induced Cycles of Length Divisible by 3. . . . . . . . . . . . . . . . . . 255 Jinha Kim
The list of books you might like
