✍️ 🧑‍🦱 💚 Autor:innen verdienen bei uns doppelt. Dank euch haben sie so schon 418.243 € mehr verdient. → Mehr erfahren 💪 📚 🙏

Sum(m)it280

Sum(m)it280

Hardcover - 9783032188090
160,49 €
  • Versandkostenfrei
Auf meine Merkliste
  • Hinweis: Print on Demand. Lieferbar in 7 Tagen.
  • Lieferzeit nach Versand: ca. 1-2 Tage
  • inkl. MwSt. & Versandkosten (innerhalb Deutschlands)

Autorenfreundlich Bücher kaufen?!

Beschreibung

The János Bolyai Mathematical Society and the HUN-REN Alfréd Rényi Institute of Mathematics (Budapest, Hungary) organized a week-long conference on the occasion of the 70th birthdays of four excellent mathematicians: Péter Frankl, Zoltán Füredi, Ervin Győri and János Pach in July 2024. The present volume mainly contains survey papers written by the invited speakers of this conference and it also includes some interesting new results, see, for example, Noga Alon’s paper in the area of extremal combinatorics. The book also comprises three excellent surveys written by Hurlbert, Kupavskii, and Jian Wang which give a good overview of extremal set theory. Moreover, two papers written by Balko and Verstraëte are surveys of certain sub-branches of Ramsey theory, while two papers written by Aslanyan-Sahakyan and Ihringer present a broad picture of the combinatorial properties of Boolean functions. Likewise, the paper written by Géza Tóth covers an interesting area of combinatorial geometry and in addition, there are subsequent papers presenting results on graph theory.

This volume will be a valuable resource for graduate students and young (perhaps also not so young) researchers interested in extremal combinatorics and combinatorial geometry.

Surveys in Extremal Combinatorics and Combinatorial Geometry

Details

Verlag Springer International Publishing
Ersterscheinung 29. Mai 2026
Maße 23.5 cm x 15.5 cm
Gewicht 873 Gramm
Format Hardcover
ISBN-13 9783032188090
Seiten 466

Schlagwörter

Herstellerinformationen +

Submit Withdrawal Request

Please fill out the following form to submit your withdrawal request.