More sets, graphs and numbers : a salute to Vera Sós and András Hajnal
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 rese...
Enregistré dans:
| Auteur principal: | |
|---|---|
| Autres auteurs: | , |
| Format: | Livre numérique |
| Langue: | Anglais |
| Publié: |
Berlin, Heidelberg :
Springer Berlin Heidelberg
[20..].
Cham : Springer Nature |
| Collection: | Bolyai Society Mathematical Studies
15 |
| Sujets: | |
| Accès en ligne: | Accès sur la plateforme de l'éditeur Accès sur la plateforme de l'éditeur (Springer) Accès sur la plateforme Istex Accès Université d'Orléans Accès INSA CVL |
| Note: |
Archives Springer e-books (Licence nationale) Archives Springer e-books (Licence nationale) |
| Autres localisations: | Voir dans le Sudoc |
| Variante du titre: | Mélanges :, Sós Mélanges :, Hajnal |
| Edition sous un autre format: | • More Sets, Graphs and Numbers, Texte imprimé, 9783540861690 • More Sets, Graphs and Numbers, Texte imprimé, 9783642421631 • More sets, graphs and numbers, a salute to vera Sos and Andras Hajnal, G. O. H. Katona, Ervin Gyori, László Lovasz (Ed.), Budapest, Janos Bolyai Mathematical Society, Springer, 2006, 1 vol. (405 p.), Bolyai Society mathematical studies, 3-540-32377-5 |
Table des matières:
- 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.