LEADER 04057nam 22005415 450 001 9910377817403321 005 20230825091518.0 010 $a3-662-59204-5 024 7 $a10.1007/978-3-662-59204-5 035 $a(CKB)4100000010160228 035 $a(DE-He213)978-3-662-59204-5 035 $a(MiAaPQ)EBC6036796 035 $a(PPN)242976611 035 $a(EXLCZ)994100000010160228 100 $a20200204d2019 u| 0 101 0 $aeng 135 $aurnn|008mamaa 181 $ctxt$2rdacontent 182 $cc$2rdamedia 183 $acr$2rdacarrier 200 10$aBuilding Bridges II $eMathematics of László Lovász /$fedited by Imre Bárány, Gyula O. H. Katona, Attila Sali 205 $a1st ed. 2019. 210 1$aBerlin, Heidelberg :$cSpringer Berlin Heidelberg :$cImprint: Springer,$d2019. 215 $a1 online resource (XII, 614 p. 51 illus., 17 illus. in color.) 225 1 $aBolyai Society Mathematical Studies,$x2947-9460 ;$v28 311 $a3-662-59203-7 327 $aIntroduction -- 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. 330 $aThis 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 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 are connected 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. 410 0$aBolyai Society Mathematical Studies,$x2947-9460 ;$v28 606 $aDiscrete mathematics 606 $aComputer science$xMathematics 606 $aDiscrete Mathematics 606 $aMathematical Applications in Computer Science 615 0$aDiscrete mathematics. 615 0$aComputer science$xMathematics. 615 14$aDiscrete Mathematics. 615 24$aMathematical Applications in Computer Science. 676 $a510 702 $aBárány$b Imre$4edt$4http://id.loc.gov/vocabulary/relators/edt 702 $aKatona$b Gyula O. H$4edt$4http://id.loc.gov/vocabulary/relators/edt 702 $aSali$b Attila$4edt$4http://id.loc.gov/vocabulary/relators/edt 801 0$bMiAaPQ 801 1$bMiAaPQ 801 2$bMiAaPQ 906 $aBOOK 912 $a9910377817403321 996 $aBuilding Bridges II$91734580 997 $aUNINA