Choose an application

• Reference Manager
• EndNote
• RefWorks (Direct export to RefWorks)

Discrete mathematics --- Graph coloring. --- Graphes, Théorie des

Choose an application

• Reference Manager
• EndNote
• RefWorks (Direct export to RefWorks)

Computer science. --- Graph coloring --- E-learning --- Computer vision

Choose an application

• Reference Manager
• EndNote
• RefWorks (Direct export to RefWorks)

This is the first book to comprehensively cover chromatic polynomialsof graphs. It includes most of the known results and unsolved problemsin the area of chromatic polynomials. Dividing the book into threemain parts, the authors take readers from the rudiments of chromaticpolynomials to more complex topics: the chromatic equivalence classesof graphs and the zeros and inequalities of chromatic polynomials.

Graph coloring. --- Graph theory. --- Polynomials. --- Algebra --- Graph theory --- Graphs, Theory of --- Theory of graphs --- Combinatorial analysis --- Topology --- Coloring of graphs --- Extremal problems

Choose an application

• Reference Manager
• EndNote
• RefWorks (Direct export to RefWorks)

Discrete mathematics --- 51 <082.1> --- Mathematics--Series --- Graph coloring --- Ramsey theory --- Random graphs. --- Coloriage de graphes --- Ramsey, Théorie de --- Graphes aléatoires --- Random graphs --- Coloring of graphs --- Graph theory --- Graphs, Random --- Combinatorial analysis --- Coloriage de graphes. --- Ramsey, Théorie de. --- Graphes aléatoires.

Choose an application

• Reference Manager
• EndNote
• RefWorks (Direct export to RefWorks)

Ramsey theory is a relatively “new,” approximately 100 year-old direction of fascinating mathematical thought that touches on many classic fields of mathematics such as combinatorics, number theory, geometry, ergodic theory, topology, combinatorial geometry, set theory, and measure theory. Ramsey theory possesses its own unifying ideas, and some of its results are among the most beautiful theorems of mathematics. The underlying theme of Ramsey theory can be formulated as: any finite coloring of a large enough system contains a monochromatic subsystem of higher degree of organization than the system itself, or as T.S. Motzkin famously put it, absolute disorder is impossible. Ramsey Theory: Yesterday, Today, and Tomorrow explores the theory’s history, recent developments, and some promising future directions through invited surveys written by prominent researchers in the field. The first three surveys provide historical background on the subject; the last three address Euclidean Ramsey theory and related coloring problems. In addition, open problems posed throughout the volume and in the concluding open problem chapter will appeal to graduate students and mathematicians alike. Contributors: J. Burkert, A. Dudek, R.L. Graham, A. Gyárfás, P.D. Johnson, Jr., S.P. Radziszowski, V. Rödl, J.H. Spencer, A. Soifer, E. Tressler.

Graph coloring. --- Graph theory. --- Mathematics. --- Ramsey numbers. --- Ramsey theory -- History. --- Ramsey theory. --- Ramsey theory --- Ramsey numbers --- Graph theory --- Graph coloring --- Mathematics --- Physical Sciences & Mathematics --- Algebra --- History --- Dynamics. --- Ergodic theory. --- Convex geometry. --- Discrete geometry. --- Combinatorics. --- Dynamical Systems and Ergodic Theory. --- Convex and Discrete Geometry. --- Combinatorial analysis --- Differentiable dynamical systems. --- Discrete groups. --- Groups, Discrete --- Infinite groups --- Differential dynamical systems --- Dynamical systems, Differentiable --- Dynamics, Differentiable --- Differential equations --- Global analysis (Mathematics) --- Topological dynamics --- Combinatorics --- Mathematical analysis --- Discrete mathematics --- Convex geometry . --- Geometry --- Combinatorial geometry --- Ergodic transformations --- Continuous groups --- Mathematical physics --- Measure theory --- Transformations (Mathematics) --- Dynamical systems --- Kinetics --- Mechanics, Analytic --- Force and energy --- Mechanics --- Physics --- Statics