Most ebook files are in PDF format, so you can easily read them using various software such as Foxit Reader or directly on the Google Chrome browser.
Some ebook files are released by publishers in other formats such as .awz, .mobi, .epub, .fb2, etc. You may need to install specific software to read these formats on mobile/PC, such as Calibre.
Please read the tutorial at this link: https://ebookbell.com/faq
We offer FREE conversion to the popular formats you request; however, this may take some time. Therefore, right after payment, please email us, and we will try to provide the service as quickly as possible.
For some exceptional file formats or broken links (if any), please refrain from opening any disputes. Instead, email us first, and we will try to assist within a maximum of 6 hours.
EbookBell Team
5.0
78 reviews
ISBN 10: 3642421636
ISBN 13: 978-3642421631
Author: Ervin Gyori, Gyula O.H. Katona, László Lovász
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.
Front Matter
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
more sets graphs and numbers
number sets graph
more graphs and displays
graph for comparing number sets
more graphs of functions
sets of numbers graph
Tags: Ervin Gyori, Gyula O H Katona, Laszlo Lovasz, More, Sets, Graphs, Numbers, Salute, Vera, Sos, Andras, Hajnal