000			04189nam a22005415i 4500
001			978-3-540-33700-3
003			DE-He213
005			20161121231033.0
007			cr nn 008mamaa
008			100301s2006 gw | s |||| 0|eng d
020			_a9783540337003 _9978-3-540-33700-3
024	7		_a10.1007/3-540-33700-8 _2doi
050		4	_aQA164-167.2
072		7	_aPBV _2bicssc
072		7	_aMAT036000 _2bisacsh
082	0	4	_a511.6 _223
245	1	0	_aTopics in Discrete Mathematics _h[electronic resource] : _bDedicated to Jarik Nešetřil on the Occasion of his 60th Birthday / _cedited by Martin Klazar, Jan Kratochvíl, Martin Loebl, Jiří Matoušek, Pavel Valtr, Robin Thomas.
264		1	_aBerlin, Heidelberg : _bSpringer Berlin Heidelberg, _c2006.
300			_aXV, 627 p. _bonline resource.
336			_atext _btxt _2rdacontent
337			_acomputer _bc _2rdamedia
338			_aonline resource _bcr _2rdacarrier
347			_atext file _bPDF _2rda
490	1		_aAlgorithms and Combinatorics, _x0937-5511 ; _v26
505	0		_aAlgebra, 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.
520			_aThe 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.
650		0	_aMathematics.
650		0	_aComputer science _xMathematics.
650		0	_aAlgorithms.
650		0	_aCombinatorics.
650	1	4	_aMathematics.
650	2	4	_aCombinatorics.
650	2	4	_aAlgorithms.
650	2	4	_aDiscrete Mathematics in Computer Science.
700	1		_aKlazar, Martin. _eeditor.
700	1		_aKratochvíl, Jan. _eeditor.
700	1		_aLoebl, Martin. _eeditor.
700	1		_aMatoušek, Jiří. _eeditor.
700	1		_aValtr, Pavel. _eeditor.
700	1		_aThomas, Robin. _eeditor.
710	2		_aSpringerLink (Online service)
773	0		_tSpringer eBooks
776	0	8	_iPrinted edition: _z9783540336983
830		0	_aAlgorithms and Combinatorics, _x0937-5511 ; _v26
856	4	0	_uhttp://dx.doi.org/10.1007/3-540-33700-8
912			_aZDB-2-SMA
950			_aMathematics and Statistics (Springer-11649)
999			_c507621 _d507621