Skip to main content
SpringerLink
Log in
Birkhäuser

Extended Abstracts EuroComb 2021

European Conference on Combinatorics, Graph Theory and Applications

  • Conference proceedings
  • © 2021

Overview

Editors:
  1. Jaroslav Nešetřil

    1. Computer Science Institute, Charles University, Praha, Czech Republic

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  2. Guillem Perarnau

    1. Departament de Matemàtiques, Universitat Politècnica de Catalunya, Barcelona, Spain

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  3. Juanjo Rué

    1. Departament de Matemàtiques, Universitat Politècnica de Catalunya, Castelldefels, Spain

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  4. Oriol Serra

    1. Departament de Matemàtiques, Universitat Politècnica de Catalunya, Barcelona, Spain

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  • Is published at every edition of EuroComb which is one of the leading conferences in the area worldwide
  • Presents the most recent achievements in this conference
  • Collects the extended abstracts of the accepted contributions to EuroComb21

Part of the book series: Trends in Mathematics (TM, volume 14)

Part of the book sub series: Research Perspectives CRM Barcelona (RPCRMB)

This is a preview of subscription content, log in via an institution to check access.

Access this book

Log in via an institution
eBook USD 149.00
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book USD 199.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Other ways to access

Licence this eBook for your library

Institutional subscriptions

Table of contents (133 papers)

  1. Front Matter

    Pages i-xvi
    Download chapter PDF

  2. Size of Local Finite Field Kakeya Sets

    • Ghurumuruhan Ganesan
    Pages 1-4

  3. Coloring of Graphs Avoiding Bicolored Paths of a Fixed Length

    • Alaittin Kırtışoğlu, Lale Özkahya
    Pages 5-11

  4. Nested Cycles with No Geometric Crossings

    • Irene Gil Fernández, Jaehoon Kim, Younjin Kim, Hong Liu
    Pages 12-17

  5. Cut Vertices in Random Planar Graphs

    • Mihyun Kang, Michael Missethan
    Pages 18-24

  6. Extremal Density for Sparse Minors and Subdivisions

    • John Haslegrave, Jaehoon Kim, Hong Liu
    Pages 25-31

  7. Enumerating Descents on Quasi-Stirling Permutations and Plane Trees

    • Sergi Elizalde
    Pages 32-37

  8. Hamiltonicity of Randomly Perturbed Graphs

    • Alberto Espuny Díaz, António Girão
    Pages 38-44

  9. The Largest Hole in Sparse Random Graphs

    • Nemanja Draganić, Stefan Glock, Michael Krivelevich
    Pages 45-49

  10. On 13-Crossing-Critical Graphs with Arbitrarily Large Degrees

    • Petr Hliněný, Michal Korbela
    Pages 50-56

  11. Local Convergence of Random Planar Graphs

    • Benedikt Stufler
    Pages 57-63

  12. Some Results on the Laplacian Spectra of Token Graphs

    • Cristina Dalfó, Frank Duque, Ruy Fabila-Monroy, Miquel Àngel Fiol, Clemens Huemer, Ana Laura Trujillo-Negrete et al.
    Pages 64-70

  13. On the Number of Compositions of Two Polycubes

    • Andrei Asinowski, Gill Barequet, Gil Ben-Shachar, Martha Carolina Osegueda, Günter Rote
    Pages 71-77

  14. Halin’s End Degree Conjecture

    • Stefan Geschke, Jan Kurkofka, Ruben Melcher, Max Pitz
    Pages 78-83

  15. Coloring Circle Arrangements: New 4-Chromatic Planar Graphs

    • Man-Kwun Chiu, Stefan Felsner, Manfred Scheucher, Felix Schröder, Raphael Steiner, Birgit Vogtenhuber
    Pages 84-91

  16. A Short Proof of Euler–Poincaré Formula

    • Petr Hliněný
    Pages 92-96

  17. Approximate MDS Property of Linear Codes

    • Ghurumuruhan Ganesan
    Pages 97-102

  18. A SAT Attack on Higher Dimensional Erdős–Szekeres Numbers

    • Manfred Scheucher
    Pages 103-110

  19. Improved Bounds on the Cop Number of a Graph Drawn on a Surface

    • Joshua Erde, Florian Lehner
    Pages 111-116

  20. Stability of Extremal Connected Hypergraphs Avoiding Berge-Paths

    • Dániel Gerbner, Dániel T. Nagy, Balázs Patkós, Nika Salia, Máté Vizer
    Pages 117-122
Back to top

Keywords

About this book

This book collects the extended abstracts of the accepted contributions to EuroComb21. A similar book is published at every edition of EuroComb (every two years since 2001) collecting the most recent advances in combinatorics, graph theory, and related areas.  It has a wide audience in the areas, and the papers are used and referenced broadly.

Editors and Affiliations

  • Computer Science Institute, Charles University, Praha, Czech Republic

    Jaroslav Nešetřil

  • Departament de Matemàtiques, Universitat Politècnica de Catalunya, Barcelona, Spain

    Guillem Perarnau, Oriol Serra

  • Departament de Matemàtiques, Universitat Politècnica de Catalunya, Castelldefels, Spain

    Juanjo Rué

Bibliographic Information

  • Book Title: Extended Abstracts EuroComb 2021

  • Book Subtitle: European Conference on Combinatorics, Graph Theory and Applications

  • Editors: Jaroslav Nešetřil, Guillem Perarnau, Juanjo Rué, Oriol Serra

  • Series Title: Trends in Mathematics

  • DOI: https://doi.org/10.1007/978-3-030-83823-2

  • Publisher: Birkhäuser Cham

  • eBook Packages: Mathematics and Statistics, Mathematics and Statistics (R0)

  • Copyright Information: The Editor(s) (if applicable) and The Author(s), under exclusive license to Springer Nature Switzerland AG 2021

  • Softcover ISBN: 978-3-030-83822-5Published: 24 August 2021

  • eBook ISBN: 978-3-030-83823-2Published: 23 August 2021

  • Series ISSN: 2297-0215

  • Series E-ISSN: 2297-024X

  • Edition Number: 1

  • Number of Pages: XVI, 858

  • Number of Illustrations: 67 b/w illustrations, 51 illustrations in colour

  • Topics: Graph Theory

Publish with us

Policies and ethics

Back to top

Search

Navigation