Topics in Discrete Mathematics

Dedicated to Jarik Nešetril on the Occasion of his 60th birthday

AvMartin Klazar,Jan Kratochvil

Häftad, Engelska, 2010

Del 26 i serien Algorithms and Combinatorics

1 653 kr

Beställningsvara. Skickas inom 10-15 vardagar. Fri frakt över 249 kr.

Beskrivning

The book offers the readers a collection of high quality papers in selected topics of Discrete Mathematics, to celebrate the 60th birthday ofProfessor 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.

Produktinformation

Utgivningsdatum:2010-11-20
Mått:155 x 235 x 35 mm
Vikt:961 g
Format:Häftad
Språk:Engelska
Serie:Algorithms and Combinatorics
Antal sidor:627
Förlag:Springer-Verlag Berlin and Heidelberg GmbH & Co. KG
ISBN:9783642070266

Utforska kategorier

Systemvetenskap och AI inom Data och IT
Programmeringsböcker inom Data och IT
Diskret matematik inom Naturvetenskap och teknik

Innehållsförteckning

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.

Du kanske också är intresserad av

Topics in Discrete Mathematics

Martin Klazar, Jan Kratochvil, Martin Loebl, Robin Thomas, Pavel Valtr

Inbunden, 2006

1 653 kr

Topics in Discrete Mathematics

Pavel Valtr, Robin Thomas, Martin Loebl, Jan Kratochvil, Martin Klazar

E-bok

2007

2 065 kr

Journey Through Discrete Mathematics

Martin Loebl, Jaroslav Nešetřil, Robin Thomas

Inbunden, 2017

1 763 kr

Journey Through Discrete Mathematics

Robin Thomas, Jaroslav Nesetril, Martin Loebl

E-bok

2017

2 224 kr

Graph Drawing and Network Visualization

Pavel Valtr, David Auber

E-bok

2021

718 kr

Del 12590

Graph Drawing and Network Visualization

David Auber, Pavel Valtr

Häftad, 2021

572 kr

Discrete Mathematics in Statistical Physics

Martin Loebl

Häftad, 2009

446 kr

Graph Drawing

Jan Kratochvil

E-bok

2003

718 kr

Discrete Mathematics in Statistical Physics

Martin Loebl

E-bok

2010

558 kr

Mathematical Foundations of Computer Science 2004

Jirí Fiala, Václav Koubek, Jan Kratochvíl

Häftad, 2004

1 137 kr

Topics in Discrete Mathematics

Dedicated to Jarik Nešetril on the Occasion of his 60th birthday

AvMartin Klazar,Jan Kratochvil

Häftad, Engelska, 2010

Del 26 i serien Algorithms and Combinatorics

1 653 kr

Beställningsvara. Skickas inom 10-15 vardagar. Fri frakt över 249 kr.

Beskrivning

Produktinformation

Utgivningsdatum:2010-11-20
Mått:155 x 235 x 35 mm
Vikt:961 g
Format:Häftad
Språk:Engelska
Serie:Algorithms and Combinatorics
Antal sidor:627
Förlag:Springer-Verlag Berlin and Heidelberg GmbH & Co. KG
ISBN:9783642070266

Utforska kategorier

Systemvetenskap och AI inom Data och IT
Programmeringsböcker inom Data och IT
Diskret matematik inom Naturvetenskap och teknik

Innehållsförteckning

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.