More Sets, Graphs and Numbers

A Salute to Vera Sòs and András Hajnal

AvErvin Gyori,Gyula O.H. Katona

Häftad, Engelska, 2014

Del 15 i serien Bolyai Society Mathematical Studies

1 102 kr

Beställningsvara. Skickas inom 10-15 vardagar. Fri frakt över 249 kr.

Fler format och utgåvor

Inbunden

1 102 kr

Beskrivning

Discrete mathematics, including (combinatorial) number theory and set theory has always been a stronghold of Hungarian mathematics. The present volume honouring Vera Sos and Andras Hajnal contains survey articles (with classical theorems and state-of-the-art results) and cutting edge expository research papers with new theorems and proofs in the area of the classical Hungarian subjects, like extremal combinatorics, colorings, combinatorial number theory, etc. The open problems and the latest results in the papers inspire further research. The volume is recommended to experienced specialists as well as to young researchers and students.

Produktinformation

Utgivningsdatum:2014-11-21
Mått:155 x 235 x 21 mm
Vikt:690 g
Format:Häftad
Språk:Engelska
Serie:Bolyai Society Mathematical Studies
Antal sidor:399
Upplaga:2006
Förlag:Springer-Verlag Berlin and Heidelberg GmbH & Co. KG
ISBN:9783642421631

Utforska kategorier

Matematik inom Naturvetenskap och teknik

Innehållsförteckning

A Unifying Generalization of Sperner’s Theorem.- A Quick Proof of Sprindzhuk’s Decomposition Theorem.- Discrepancy in Graphs and Hypergraphs.- Biplanar Crossing Numbers I: A Survey of Results and Problems.- An Exercise on the Average Number of Real Zeros of Random Real Polynomials.- Edge-Connection of Graphs, Digraphs, and Hypergraphs.- Perfect Powers in Products with Consecutive Terms from Arithmetic Progressions.- The Topological Version of Fodor’s Theorem.- Color-Critical Graphs and Hypergraphs with Few Edges: A Survey.- Pseudo-random Graphs.- Bounds and Extrema for Classes of Graphs and Finite Structures.- Relaxing Planarity for Topological Graphs.- Notes on CNS Polynomials and Integral Interpolation.- The Evolution of an Idea — Gallai’s Algorithm.- On the Number of Additive Representations of Integers.- A Lifting Theorem on Forcing LCS Spaces.- Extremal Functions for Graph Minors.- Periodicity and Almost-Periodicity.

Mer från samma författare

More Sets, Graphs and Numbers

Laszlo Lovasz, Gyula O.H. Katona, Ervin Gyori

E-bok

2010

1 427 kr

Del 17

Horizons of Combinatorics

Ervin Gyori, Gyula O.H. Katona, László Lovász

Inbunden, 2008

1 102 kr

Horizons of Combinatorics

Laszlo Lovasz, Gyula O.H. Katona, Ervin Gyori

E-bok

2008

1 427 kr

Del 17

Horizons of Combinatorics

Ervin Gyori, Gyula O.H. Katona, László Lovász

Häftad, 2010

1 102 kr

Mer från samma serie

Del 29

Optimal Transport on Quantum Structures

Jan Maas, Simone Rademacher, Tamás Titkos, Dániel Virosztek

Inbunden, 2024

1 321 kr

Del 29

Optimal Transport on Quantum Structures

Jan Maas, Simone Rademacher, Tamás Titkos, Dániel Virosztek

Häftad, 2025

1 321 kr

Del 30

Singularities and Low Dimensional Topology

Javier Fernández de Bobadilla, Marco Marengon, András Némethi, András Stipsicz

Inbunden, 2024

1 544 kr

Del 30

Singularities and Low Dimensional Topology

Javier Fernández de Bobadilla, Marco Marengon, András Némethi, András Stipsicz

Häftad, 2025

1 544 kr

Del 31

Courses in Discrete and Computational Geometry

János Pach, Géza Tóth

Inbunden, 2026

1 649 kr

New Structures in Low-Dimensional Topology

Aaron Lauda, Marco Marengon, Gordana Matić, András I. Stipsicz

Häftad, 2026

1 342 kr

Sum(m)it280

Gyula O. H. Katona, Balázs Patkós, Casey Tompkins

Inbunden, 2026

1 649 kr

New Probes into Discrete and Convex Geometry

János Pach, Géza Tóth

Inbunden, 2026

2 121 kr

Del 26

Contact and Symplectic Topology

Frédéric Bourgeois, Vincent Colin, András Stipsicz

Inbunden, 2014

1 430 kr

Del 26

Contact and Symplectic Topology

Frédéric Bourgeois, Vincent Colin, András Stipsicz

Häftad, 2016

1 430 kr

Du kanske också är intresserad av

10% rabatt på allt

L'amour toujours : Berättelsen om Tidö

Maggie Strömberg, Torbjörn Nilsson

Inbunden, 2026

275 kr

Del 17

Horizons of Combinatorics

Ervin Gyori, Gyula O.H. Katona, László Lovász

Häftad, 2010

1 102 kr

Del 15

More Sets, Graphs and Numbers

Ervin Gyori, Gyula O.H. Katona, László Lovász

Inbunden, 2006

1 102 kr

More Sets, Graphs and Numbers

Laszlo Lovasz, Gyula O.H. Katona, Ervin Gyori

E-bok

2010

1 427 kr

Horizons of Combinatorics

Laszlo Lovasz, Gyula O.H. Katona, Ervin Gyori

E-bok

2008

1 427 kr

Del 17

Horizons of Combinatorics

Ervin Gyori, Gyula O.H. Katona, László Lovász

Inbunden, 2008

1 102 kr

Building Bridges

Martin Grötschel, Gyula O.H. Katona

Inbunden, 2008

1 102 kr

Fete of Combinatorics and Computer Science

Gyula O.H. Katona, Alexander Schrijver, Tamás Szönyi

Inbunden, 2010

1 102 kr

Semantics in Databases

Bernhard Thalheim, Klaus-Dieter Schewe, Gyula O.H. Katona, Leopoldo Bertossi

E-bok

2003

718 kr

Entropy, Search, Complexity

Imre Csiszár, Gyula O.H. Katona, Gabor Tardos

Inbunden, 2007

1 102 kr

More Sets, Graphs and Numbers

A Salute to Vera Sòs and András Hajnal

AvErvin Gyori,Gyula O.H. Katona

Häftad, Engelska, 2014

Del 15 i serien Bolyai Society Mathematical Studies

1 102 kr

Beställningsvara. Skickas inom 10-15 vardagar. Fri frakt över 249 kr.

Fler format och utgåvor

Inbunden

1 102 kr

Beskrivning

Produktinformation

Utgivningsdatum:2014-11-21
Mått:155 x 235 x 21 mm
Vikt:690 g
Format:Häftad
Språk:Engelska
Serie:Bolyai Society Mathematical Studies
Antal sidor:399
Upplaga:2006
Förlag:Springer-Verlag Berlin and Heidelberg GmbH & Co. KG
ISBN:9783642421631

Utforska kategorier

Matematik inom Naturvetenskap och teknik

Innehållsförteckning

A Unifying Generalization of Sperner’s Theorem.- A Quick Proof of Sprindzhuk’s Decomposition Theorem.- Discrepancy in Graphs and Hypergraphs.- Biplanar Crossing Numbers I: A Survey of Results and Problems.- An Exercise on the Average Number of Real Zeros of Random Real Polynomials.- Edge-Connection of Graphs, Digraphs, and Hypergraphs.- Perfect Powers in Products with Consecutive Terms from Arithmetic Progressions.- The Topological Version of Fodor’s Theorem.- Color-Critical Graphs and Hypergraphs with Few Edges: A Survey.- Pseudo-random Graphs.- Bounds and Extrema for Classes of Graphs and Finite Structures.- Relaxing Planarity for Topological Graphs.- Notes on CNS Polynomials and Integral Interpolation.- The Evolution of an Idea — Gallai’s Algorithm.- On the Number of Additive Representations of Integers.- A Lifting Theorem on Forcing LCS Spaces.- Extremal Functions for Graph Minors.- Periodicity and Almost-Periodicity.