Building Bridges II Mathematics of László Lovász /

• Corporate Author: SpringerLink (Online service)
• Other Authors: Bárány, Imre (Editor, http://id.loc.gov/vocabulary/relators/edt), Katona, Gyula O. H. (Editor, http://id.loc.gov/vocabulary/relators/edt), Sali, Attila (Editor, http://id.loc.gov/vocabulary/relators/edt)
• Format: Electronic eBook
• Language: English
• Published: Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer, 2019.
• Edition: 1st ed. 2019.
• Series: Bolyai Society Mathematical Studies, 28
• Subjects: Combinatorics.; Computer science-Mathematics.; Computer mathematics.; Mathematical Applications in Computer Science.

This volume collects together research and survey papers written by invited speakers of a 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 combin...

Table of Contents:

• Introduction
• N. Alon: Lovász, Vectors, Graphs and Codes
• A. Björner: Continuous matroids revisited
• C. Borgs, J. T. Chayes, H. Cohn and L. M. Lovász: Identifiability for Graphexes and the Weak Kernel Metric
• D. Conlon, J. Fox, A. Grinshpun and Xiaoyu He: Online Ramsey Numbers and the Subraph Query Problem
• P. Csikvári: Statistical Matching Theory
• P. Diaconis: A conversation with Laci
• U. Feige: Tighter Bounds for Bipartite Matching
• T. Jordán and A. Mihálykó: Minimum Cost Globally Rigid Subgraphs
• P. Keevash: Colored and Directed Designs
• Jin Tat Lee, A. Sidford and S. S. Vempala: Efficient Convex Optimization with Oracles
• J. Nesetril and P. Osona de Mendes: Approximations of Mappings
• O. E. Raz and A. Wigderson: Derandomization Through Submodular Optimization
• A. Schrijver: Finding k Partially Disjoint Paths in a Directed Planar Graph
• M. Simonovits and E. Szemerédi: Embedding graphs into larger graphs, results, methods and problems.