More Sets, Graphs and Numbers de Ervin Győri

More Sets, Graphs and Numbers: Bolyai Society Mathematical Studies, cartea 15

Ervin Győri

Gyula O. H. Katona

László Lovász

en Limba Engleză Paperback – 21 noi 2014

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

	Preț	Express
Paperback (1)	621^.57 lei 6-8 săpt.
Springer – 21 noi 2014	621^.57 lei 6-8 săpt.
Hardback (1)	624^.70 lei 6-8 săpt.
Springer – 30 mar 2006	624^.70 lei 6-8 săpt.

Din seria Bolyai Society Mathematical Studies

Preț: 386^.89 lei
20%

Preț: 528^.06 lei
24%

Preț: 1981^.88 lei
15%

Preț: 625^.07 lei
18%

Preț: 756^.38 lei
15%

Preț: 635^.48 lei
15%

Preț: 624^.70 lei
15%

Preț: 613^.71 lei
15%

Preț: 620^.86 lei
20%

Preț: 616^.23 lei
15%

Preț: 614^.61 lei
15%

Preț: 635^.80 lei
15%

Preț: 629^.24 lei
15%

Preț: 629^.97 lei
20%

Preț: 632^.09 lei
24%

Preț: 911^.78 lei
15%

Preț: 628^.15 lei
Preț: 378^.71 lei
18%

Preț: 1089^.03 lei
18%

Preț: 712^.54 lei
15%

Preț: 630^.07 lei

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.