Topics in Discrete Mathematics de Martin Klazar

Topics in Discrete Mathematics: Dedicated to Jarik Nešetril on the Occasion of his 60th birthday: Algorithms and Combinatorics, cartea 26

Martin Klazar

Jan Kratochvil

Martin Loebl

Robin Thomas

Pavel Valtr

en Limba Engleză Paperback – 20 noi 2010

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.

Citește tot Restrânge

	Preț	Express
Paperback (1)	960^.93 lei 6-8 săpt.
Springer Berlin, Heidelberg – 20 noi 2010	960^.93 lei 6-8 săpt.
Hardback (1)	967^.22 lei 6-8 săpt.
Springer Berlin, Heidelberg – 11 iul 2006	967^.22 lei 6-8 săpt.

Preț

Express

Paperback (1)

960^.93 lei 6-8 săpt.

Springer Berlin, Heidelberg – 20 noi 2010

960^.93 lei 6-8 săpt.

Hardback (1)

967^.22 lei 6-8 săpt.

Springer Berlin, Heidelberg – 11 iul 2006

967^.22 lei 6-8 săpt.

Din seria Algorithms and Combinatorics

18%

Preț: 1123^.67 lei
Preț: 387^.38 lei
Preț: 391^.61 lei
15%

Preț: 639^.08 lei
15%

Preț: 658^.22 lei
18%

Preț: 965^.34 lei
15%

Preț: 649^.22 lei
18%

Preț: 781^.00 lei
18%

Preț: 950^.96 lei
18%

Preț: 953^.35 lei
18%

Preț: 897^.65 lei
Preț: 512^.18 lei
15%

Preț: 638^.89 lei
18%

Preț: 897^.65 lei
24%

Preț: 912^.87 lei
18%

Preț: 979^.70 lei
18%

Preț: 967^.22 lei
20%

Preț: 500^.19 lei
15%

Preț: 593^.08 lei
Preț: 399^.50 lei
15%

Preț: 644^.18 lei
18%

Preț: 972^.42 lei
Preț: 386^.00 lei
15%

Preț: 589^.14 lei
15%

Preț: 642^.51 lei
15%

Preț: 656^.43 lei
Preț: 381^.43 lei

Specificații

ISBN-13: 9783642070266
ISBN-10: 3642070264
Pagini: 644
Ilustrații: XV, 627 p.
Dimensiuni: 155 x 235 x 34 mm
Greutate: 0.89 kg
Ediția:Softcover reprint of hardcover 1st ed. 2006
Editura: Springer Berlin, Heidelberg
Colecția Springer
Seria Algorithms and Combinatorics

Locul publicării:Berlin, Heidelberg, Germany

Cuprins

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 Nešet?il.