Cantitate/Preț
Produs

More Sets, Graphs and Numbers: A Salute to Vera Sòs and András Hajnal: Bolyai Society Mathematical Studies, cartea 15

Editat de Ervin Gyori, Gyula O.H. Katona, László Lovász
en Limba Engleză Hardback – 30 mar 2006
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.
Citește tot Restrânge

Toate formatele și edițiile

Toate formatele și edițiile Preț Express
Paperback (1) 64579 lei  6-8 săpt.
  Springer Berlin, Heidelberg – 21 noi 2014 64579 lei  6-8 săpt.
Hardback (1) 65477 lei  6-8 săpt.
  Springer Berlin, Heidelberg – 30 mar 2006 65477 lei  6-8 săpt.

Din seria Bolyai Society Mathematical Studies

Preț: 65477 lei

Preț vechi: 77031 lei
-15% Nou

Puncte Express: 982

Preț estimativ în valută:
12532 13034$ 10502£

Carte tipărită la comandă

Livrare economică 14-28 martie

Preluare comenzi: 021 569.72.76

Specificații

ISBN-13: 9783540323778
ISBN-10: 3540323775
Pagini: 412
Ilustrații: VIII, 399 p.
Dimensiuni: 155 x 235 x 28 mm
Greutate: 0.82 kg
Ediția:2006
Editura: Springer Berlin, Heidelberg
Colecția Springer
Seria Bolyai Society Mathematical Studies

Locul publicării:Berlin, Heidelberg, Germany

Public țintă

Research

Cuprins

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.