Choose an application

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

Analyse combinatoire. --- Ramsey, Théorie de. --- Ramsey theory --- Combinatorial analysis --- Ramsey numbers.

Choose an application

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

The present reprint contains twelve papers published in the Special Issue “Advances in Discrete Applied Mathematics and Graph Theory, 2021” of the MDPI Mathematics journal, which cover a wide range of topics connected to the theory and applications of Graph Theory and Discrete Applied Mathematics. The focus of the majority of papers is on recent advances in graph theory and applications in chemical graph theory. In particular, the topics studied include bipartite and multipartite Ramsey numbers, graph coloring and chromatic numbers, several varieties of domination (Double Roman, Quasi-Total Roman, Total 3-Roman) and two graph indices of interest in chemical graph theory (Sombor index, generalized ABC index), as well as hyperspaces of graphs and local inclusive distance vertex irregular graphs.

Research & information: general --- Mathematics & science --- dominating set --- total roman {3}-domination --- NP-complete --- linear-time algorithm --- Ramsey numbers --- multipartite Ramsey numbers --- stripes --- paths --- cycle --- ABC index --- generalizedABC index --- general Randić index --- topological indices --- converse Hölder inequality --- local antimagic labeling --- local antimagic chromatic number --- copies of graphs --- hyperspace --- graph --- dendroid --- dendrite --- (inclusive) distance vertex irregular labeling --- local (inclusive) distance vertex irregular labeling --- quasi-total Roman domination --- total Roman domination --- Roman domination --- double Roman domination --- generalized Petersen graph --- discharging method --- graph cover --- double Roman graph --- topological index --- vertex degree --- Sombor index --- cactus --- quasi-unicyclic graph --- bipartite Ramsey numbers --- Zarankiewicz number --- total coloring --- dumbbell maximal planar graphs --- I-dumbbell maximal planar graphs --- dumbbell transformation --- total coloring algorithm --- domination coloring --- domination chromatic number --- split graphs --- generalized Petersen graphs --- corona products --- edge corona products --- dominating set --- total roman {3}-domination --- NP-complete --- linear-time algorithm --- Ramsey numbers --- multipartite Ramsey numbers --- stripes --- paths --- cycle --- ABC index --- generalizedABC index --- general Randić index --- topological indices --- converse Hölder inequality --- local antimagic labeling --- local antimagic chromatic number --- copies of graphs --- hyperspace --- graph --- dendroid --- dendrite --- (inclusive) distance vertex irregular labeling --- local (inclusive) distance vertex irregular labeling --- quasi-total Roman domination --- total Roman domination --- Roman domination --- double Roman domination --- generalized Petersen graph --- discharging method --- graph cover --- double Roman graph --- topological index --- vertex degree --- Sombor index --- cactus --- quasi-unicyclic graph --- bipartite Ramsey numbers --- Zarankiewicz number --- total coloring --- dumbbell maximal planar graphs --- I-dumbbell maximal planar graphs --- dumbbell transformation --- total coloring algorithm --- domination coloring --- domination chromatic number --- split graphs --- generalized Petersen graphs --- corona products --- edge corona products

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