Overview

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.

Full Product Details

Author:   Ervin Gyori ,  Gyula O.H. Katona ,  László Lovász
Publisher:   Springer-Verlag Berlin and Heidelberg GmbH & Co. KG
Imprint:   Springer-Verlag Berlin and Heidelberg GmbH & Co. K
Edition:   2006 ed.
Volume:   15
Dimensions:   Width: 15.50cm , Height: 2.10cm , Length: 23.50cm
Weight:   0.734kg
ISBN:  

9783642421631

ISBN 10:   3642421636
Pages:   399
Publication Date:   21 November 2014
Audience:   College/higher education ,  Undergraduate
Format:   Paperback
Publisher's Status:   Active
Availability:   Manufactured on demand  
We will order this item for you from a manufactured on demand supplier.

Table of Contents

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.

Reviews

Author Information

Tab Content 6

Author Website:  

Customer Reviews

Recent Reviews

No review item found!

Add your own review!

Countries Available

All regions