Skip to main content
  • Book
  • © 2019

Building Bridges II

Mathematics of László Lovász

  • Includes 14 contributions of leading researchers in the fields of combinatorics and computer science
  • Builds bridges between discrete and continuous mathematics
  • Includes open problems in various connected areas

Part of the book series: Bolyai Society Mathematical Studies (BSMS, volume 28)

Buy it now

Buying options

eBook USD 44.99 USD 84.99
47% discount Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book USD 59.99 USD 109.99
45% discount Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book USD 59.99 USD 109.99
45% discount Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Other ways to access

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

Table of contents (14 chapters)

  1. Front Matter

    Pages i-xii
  2. Lovász, Vectors, Graphs and Codes

    • Noga Alon
    Pages 1-16
  3. Continuous Matroids Revisited

    • Anders Björner
    Pages 17-28
  4. Identifiability for Graphexes and the Weak Kernel Metric

    • Christian Borgs, Jennifer T. Chayes, Henry Cohn, László Miklós Lovász
    Pages 29-157
  5. Online Ramsey Numbers and the Subgraph Query Problem

    • David Conlon, Jacob Fox, Andrey Grinshpun, Xiaoyu He
    Pages 159-194
  6. Statistical Matching Theory

    • Péter Csikvári
    Pages 195-221
  7. Minimum Cost Globally Rigid Subgraphs

    • Tibor Jordán, András Mihálykó
    Pages 257-278
  8. Coloured and Directed Designs

    • Peter Keevash
    Pages 279-315
  9. Efficient Convex Optimization with Oracles

    • Yin Tat Lee, Aaron Sidford, Santosh S. Vempala
    Pages 317-335
  10. Approximations of Mappings

    • Jaroslav Nešetřil, Patrice Ossona de Mendez
    Pages 337-375
  11. Embedding Graphs into Larger Graphs: Results, Methods, and Problems

    • Miklós Simonovits, Endre Szemerédi
    Pages 445-592
  12. Back Matter

    Pages 593-614

About this book

This volume collects together research and survey papers written by invited speakers of the conference celebrating the 70th birthday of László Lovász.

The topics covered include classical subjects such as extremal graph theory, coding theory, design theory, applications of linear algebra and combinatorial optimization, as well as recent trends such as extensions of graph limits, online or statistical versions of classical combinatorial problems, and new methods of derandomization.

László Lovász is one of the pioneers in the interplay between discrete and continuous mathematics, and is a master at establishing unexpected connections, “building bridges” between seemingly distant fields. His invariably elegant and powerful ideas have produced new subfields in many areas, and his outstanding scientific work has defined and shaped many research directions in the last 50 years.

The 14 contributions presented in this volume, all of which areconnected to László Lovász's areas of research, offer an excellent overview of the state of the art of combinatorics and related topics and will be of interest to experienced specialists as well as young researchers.


Editors and Affiliations

  • MTA Alfréd Rényi Institute of Mathematics, Budapest, Hungary

    Imre Bárány, Gyula O. H. Katona, Attila Sali

About the editors

Imre Bárány is a research professor at the Alfréd Rényi Institute of Mathematics in Budapest and the Astor Professor of Mathematics at University College London. His main field of interest is discrete and convex geometry, in particular random points and lattice points in convex bodies, with applications in computer science, operations research, and elsewhere. He was an invited speaker at ICM 2002, Beijing. He has organized several conferences in discrete and convex geometry, including three in Oberwolfach on Discrete Geometry.

Gyula O.H. Katona is a research professor emeritus at the Alfréd Rényi Institute of Mathematics in Budapest. His main field of interest is combinatorics, including extremal problems for graphs and hypergraphs, connections to probability theory and measure theory, the theory of databases, search theory, and cryptology. He is a member of the European Academy of Sciences, ordinary member of the Hungarian Academy of Sciences and foreign memberof the Bulgarian Academy of Sciences. He has organized more than 15 conferences in combinatorics, more than half of them as chairman of the organizing committee. He is a member of the editorial boards of 22 leading journals in combinatorics. He has received several awards, the most prestigious being the Order of Merit of the Hungarian Republic (civilian), the Officer Cross, awarded by the President of Hungary, 2004, and the Széchenyi Prize, awarded by the President of Hungary, 2005.

Attila Sali is a research professor at the Alfréd Rényi Institute of Mathematics in Budapest. His main field of interest is combinatorics, with a focus on extremal problems for graphs and hypergraphs, and the combinatorics of databases. He has also done extensive research in algebraic combinatorics. He is a recipient of the Excellent Young Researcher award of the Hungarian Academy of Sciences. He has been the secretary of the organizing committee of about 10 combinatorial conferences, and served as chair of the program committee at FoIKS 2012.

 

Bibliographic Information

  • Book Title: Building Bridges II

  • Book Subtitle: Mathematics of László Lovász

  • Editors: Imre Bárány, Gyula O. H. Katona, Attila Sali

  • Series Title: Bolyai Society Mathematical Studies

  • DOI: https://doi.org/10.1007/978-3-662-59204-5

  • Publisher: Springer Berlin, Heidelberg

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

  • Copyright Information: J�nos Bolyai Mathematical Society and Springer-Verlag GmbH Germany, part of Springer Nature 2019

  • Hardcover ISBN: 978-3-662-59203-8Published: 05 February 2020

  • Softcover ISBN: 978-3-662-59206-9Published: 26 August 2021

  • eBook ISBN: 978-3-662-59204-5Published: 04 February 2020

  • Series ISSN: 1217-4696

  • Series E-ISSN: 2947-9460

  • Edition Number: 1

  • Number of Pages: XII, 614

  • Number of Illustrations: 34 b/w illustrations, 17 illustrations in colour

  • Topics: Combinatorics, Mathematical Applications in Computer Science

Buy it now

Buying options

eBook USD 44.99 USD 84.99
47% discount Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book USD 59.99 USD 109.99
45% discount Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book USD 59.99 USD 109.99
45% discount Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Other ways to access