More Sets, Graphs and Numbers
Editat de Ervin Gyori, László Lovász, Gyula O. H. Katonaen Limba Engleză Paperback – 21 noi 2014
The volume is recommended to experienced specialists as well as to young researchers and students.
Preț: 625.13 lei
Preț vechi: 735.44 lei
-15% Nou
Puncte Express: 938
Preț estimativ în valută:
110.62€ • 129.71$ • 97.15£
110.62€ • 129.71$ • 97.15£
Carte tipărită la comandă
Livrare economică 06-20 februarie 26
Preluare comenzi: 021 569.72.76
Specificații
ISBN-13: 9783642421631
ISBN-10: 3642421636
Pagini: 408
Ilustrații: VIII, 399 p.
Dimensiuni: 155 x 235 x 21 mm
Greutate: 0.69 kg
Ediția:2006
Editura: Springer Berlin, Heidelberg
Locul publicării:Berlin, Heidelberg, Germany
ISBN-10: 3642421636
Pagini: 408
Ilustrații: VIII, 399 p.
Dimensiuni: 155 x 235 x 21 mm
Greutate: 0.69 kg
Ediția:2006
Editura: Springer Berlin, Heidelberg
Locul publicării:Berlin, Heidelberg, Germany
Public țintă
ResearchCuprins
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.