Fr. 189.00

Topics in Discrete Mathematics - Dedicated to Jarik Nesetril on the Occasion of his 60th birthday

English · Paperback / Softback

Shipping usually within 6 to 7 weeks

Description

Read more

The book offers the readers a collection of high quality papers in selected topics of Discrete Mathematics, to celebrate the 60th birthday of
Professor Jarik Nesetril. Leading experts have contributed survey and research
papers in the areas of Algebraic Combinatorics, Combinatorial
Number Theory, Game theory, Ramsey Theory, Graphs and Hypergraphs,
Homomorphisms, Graph Colorings and Graph Embeddings.

List of contents

Algebra, Geometry, Numbers.- Countable Almost Rigid Heyting Algebras.- Piecewise-Bohr Sets of Integers and Combinatorial Number Theory.- A Generalization of Conway Number Games to Multiple Players.- Two Isoperimetric Problems for Euclidean Simplices.- On Finitely Generated Varieties of Distributive Double p-algebras and their Subquasivarieties.- The F-triangle of the Generalised Cluster Complex.- Ramsey Theory.- Monochromatic Equilateral Right Triangles on the Integer Grid.- One-sided Coverings of Colored Complete Bipartite Graphs.- Nonconstant Monochromatic Solutions to Systems of Linear Equations.- On the Induced Ramsey Number IR(P 3, H).- On Explicit Ramsey Graphs and Estimates of the Number of Sums and Products.- Graphs and Hypergraphs.- Hereditary Properties of Ordered Graphs.- A Proof and Generalizations of the Erd?s-Ko-Rado Theorem Using the Method of Linearly Independent Polynomials.- Unions of Perfect Matchings in Cubic Graphs.- Random Graphs from Planar and Other Addable Classes.- Extremal Hypergraph Problems and the Regularity Method.- Homomorphisms.- Homomorphisms in Graph Property Testing.- Counting Graph Homomorphisms.- Efficient Algorithms for Parameterized H-colorings.- From Graph Colouring to Constraint Satisfaction: There and Back Again.- Graph Colorings.- Thresholds for Path Colorings of Planar Graphs.- Chromatic Numbers and Homomorphisms of Large Girth Hypergraphs.- Acyclic 4-Choosability of Planar Graphs Without Cycles of Specific Lengths.- On the Algorithmic Aspects of Hedetniemi's Conjecture.- Recent Developments in Circular Colouring of Graphs.- Graph Embeddings.- Regular Embeddings of Multigraphs.- Quadrangulations and 5-critical Graphs on the Projective Plane.- Crossing Number of Toroidal Graphs.- Regular Maps on a Given Surface: A Survey.-VII.- On Six Problems Posed by Jarik Neset?il.

Summary

The book offers the readers a collection of high quality papers in selected topics of Discrete Mathematics, to celebrate the 60th birthday of
Professor Jarik Nešetril. Leading experts have contributed survey and research
papers in the areas of Algebraic Combinatorics, Combinatorial
Number Theory, Game theory, Ramsey Theory, Graphs and Hypergraphs,
Homomorphisms, Graph Colorings and Graph Embeddings.

Product details

Assisted by Martin Klazar (Editor), Ja Kratochvil (Editor), Jan Kratochvil (Editor), Martin Loebl (Editor), Martin Loebl et al (Editor), Jiri Matousek (Editor), Robin Thomas (Editor), Pavel Valtr (Editor)
Publisher Springer, Berlin
 
Languages English
Product format Paperback / Softback
Released 12.10.2010
 
EAN 9783642070266
ISBN 978-3-642-07026-6
No. of pages 627
Dimensions 156 mm x 235 mm x 236 mm
Weight 961 g
Illustrations XV, 627 p.
Series Algorithms and Combinatorics
Algorithms and Combinatorics
Subjects Children's and young people's books > Young people's books from 12 years of age
Natural sciences, medicine, IT, technology > Mathematics > Miscellaneous

C, Algorithmen und Datenstrukturen, Algorithms, Mathematik für Informatiker, Combinatorics, Mathematics and Statistics, Discrete Mathematics in Computer Science, Discrete Mathematics, Number Theory, Numerical analysis, Computer science—Mathematics, Maths for computer scientists

Customer reviews

No reviews have been written for this item yet. Write the first review and be helpful to other users when they decide on a purchase.

Write a review

Thumbs up or thumbs down? Write your own review.

For messages to CeDe.ch please use the contact form.

The input fields marked * are obligatory

By submitting this form you agree to our data privacy statement.