Cantitate/Preț
Produs
Total produse
Vezi coșul
Geometric Graphs and Arrangements: Some Chapters from Combinatorial Geometry de Stefan Felsner

Geometric Graphs and Arrangements: Some Chapters from Combinatorial Geometry: Advanced Lectures in Mathematics

Autor Stefan Felsner
en Limba Engleză Paperback – 24 feb 2004
Among the intuitively appealing aspects of graph theory is its close connection to drawings and geometry. The development of computer technology has become a source of motivation to reconsider these connections, in particular geometric graphs are emerging as a new subfield of graph theory. Arrangements of points and lines are the objects for many challenging problems and surprising solutions in combinatorial geometry. The book is a collection of beautiful and mostly very recent results from the intersection of geometry, graph theory and combinatorics.
Citește tot Restrânge

Din seria Advanced Lectures in Mathematics

  • Discrete Mathematics in Statistical Physics: Introductory Lectures
    Preț: 32231 lei
  • Stochastic Integrals: An Introduction
    Preț: 49062 lei
  • 15% Optimization Theory and Applications
    Preț: 49847 lei
  • Asymptotic Distribution Theory in Nonparametric Statistics
    Preț: 41671 lei
  • 15% Regular Solids and Isolated Singularities
    Preț: 44151 lei
  • Stable Solution of Inverse Problems
    Preț: 42193 lei
  • Kähler Differentials
    Preț: 49448 lei
  • 15% Topics on Real Analytic Spaces
    Preț: 46645 lei
  • Topics on Real and Complex Singularities: An Introduction
    Preț: 41943 lei
  • Ruled Varieties: An Introduction to Algebraic Differential Geometry
    Preț: 31502 lei
  • The Steiner Tree Problem: A Tour through Graphs, Algorithms, and Complexity
    Preț: 35454 lei
  • 19% The Basic Theory of Power Series
    Preț: 43685 lei
  • Dirac-Operatoren in der Riemannschen Geometrie: Mit einem Ausblick auf die Seiberg-Witten-Theorie
    Preț: 28388 lei
  • Einführung in die Symplektische Geometrie
    Preț: 28183 lei
  • 20% Topics in the Calculus of Variations
    Preț: 55025 lei
  • Lattices and Codes: A Course Partially Based on Lectures by Friedrich Hirzebruch
    Preț: 45033 lei
  • 15% Local Analytic Geometry: Basic Theory and Applications
    Preț: 59373 lei
  • Programmierbare Taschenrechner in der Elektrotechnik: Anwendung der TI58 und TI59
    Preț: 49987 lei
  • Wavelets — Eine Einführung
    Preț: 31730 lei
  • 15% Introduction to Markov Chains: With Special Emphasis on Rapid Mixing
    Preț: 58458 lei
  • Variational Principles for Discrete Surfaces
    Preț: 31322 lei
  • 18% Handbook of Group Actions
    Preț: 80833 lei

Preț: 26518 lei

Nou

Puncte Express: 398
Preț estimativ în valută:
5075€ • 5266$ • 4242£

Carte tipărită la comandă

Livrare economică 15-29 martie

 Adaugă în coș

Wish list
Gift list
Am citit!
Adaugă în listă
Preluare comenzi: 021 569.72.76

Specificații

ISBN-13: 9783528069728
ISBN-10: 3528069724
Pagini: 184
Ilustrații: X, 170 p.
Dimensiuni: 170 x 240 x 10 mm
Greutate: 0.3 kg
Ediția:Softcover reprint of the original 1st ed. 2004
Editura: Vieweg+Teubner Verlag
Colecția Vieweg+Teubner Verlag
Seria Advanced Lectures in Mathematics

Locul publicării:Wiesbaden, Germany

Public țintă

Upper undergraduate

Cuprins

1 Geometric Graphs: Turán Problems.- 1.1 What is a Geometric Graph?.- 1.2 Fundamental Concepts in Graph Theory.- 1.3 Planar Graphs.- 1.4 Outerplanar Graphs and Convex Geometric Graphs.- 1.5 Geometric Graphs without (k + 1)-Pairwise Disjoint Edges.- 1.6 Geometric Graphs without Parallel Edges.- 1.7 Notes and References.- 2 Schnyder Woods or How to Draw a Planar Graph?.- 2.1 Schnyder Labelings and Woods.- 2.2 Regions and Coordinates.- 2.3 Geodesic Embeddings of Planar Graphs.- 2.4 Dual Schnyder Woods.- 2.5 Order Dimension of 3-Polytopes.- 2.6 Existence of Schnyder Labelings.- 2.7 Notes and References.- 3 Topological Graphs: Crossing Lemma and Applications.- 3.1 Crossing Numbers.- 3.2 Bounds for the Crossing Number.- 3.3 Improving the Crossing Constant.- 3.4 Crossing Numbers and Incidence Problems.- 3.5 Notes and References.- 4 k-Sets and k-Facets.- 4.1 k-Sets in the Plane.- 4.2 Beyond the Plane.- 4.3 The Rectilinear Crossing Number of Kn.- 4.4 Notes and References.- 5 Combinatorial Problems for Sets of Points and Lines.- 5.1 Arrangements, Planes, Duality.- 5.2 Sylvester’s Problem.- 5.3 How many Lines are Spanned by n Points?.- 5.4 Triangles in Arrangements.- 5.5 Notes and References.- 6 Combinatorial Representations of Arrangements of Pseudolines.- 6.1 Marked Arrangements and Sweeps.- 6.2 Allowable Sequences and Wiring Diagrams.- 6.3 Local Sequences.- 6.4 Zonotopal Tilings.- 6.5 Triangle Signs.- 6.6 Signotopes and their Orders.- 6.7 Notes and References.- 7 Triangulations and Flips.- 7.1 Degrees in the Flip-Graph.- 7.2 Delaunay Triangulations.- 7.3 Regular Triangulations and Secondary Polytopes.- 7.4 The Associahedron and Catalan families.- 7.5 The Diameter of Gn and Hyperbolic Geometry.- 7.6 Notes and References.- 8 Rigidity and Pseudotriangulations.- 8.1 Rigidity,Motion and Stress.- 8.2 Pseudotriangles and Pseudotriangulations.- 8.3 Expansive Motions.- 8.4 The Polyhedron of of Pointed Pseudotriangulations.- 8.5 Expansive Motions and Straightening Linkages.- 8.6 Notes and References.

Recenzii

"The book is written in a pleasant and clear style, with generous pictures and lucid explanations. [...] I recommend this splendid litte book für PhD students and researchers who work or wish to work in discrete geometry".
Combinatorics, Probability and Computing (Cambridge University Press), 15/2006

"[The author] has contributed an introduction to this fascinating and mathematically challenging - yet intuitively accessible - field."
Monatshefte für Mathematik, 02/2006

Notă biografică

Prof. Dr. Stefan Felsner, Institut für Mathematik, Technische Universität Berlin, Germany.

Textul de pe ultima copertă

Among the intuitively appealing aspects of graph theory is its close connection to drawings and geometry. The development of computer technology has become a source of motivation to reconsider these connections, in particular geometric graphs are emerging as a new subfield of graph theory. Arrangements of points and lines are the objects for many challenging problems and surprising solutions in combinatorial geometry. The book is a collection of beautiful and partly very recent results from the intersection of geometry, graph theory and combinatorics.

Caracteristici

Graph theory, geometry and combinatorics brought together to generate a wealth of beauty in ideas