Submitted:
05 February 2025
Posted:
06 February 2025
You are already at the latest version
Abstract
Keywords:
1. Introduction
2. Results
2.1. Coloring Procedure Applicable for the Motion of Point Masses. Bi-Coloring for a Pair of Particles
2.2. Coloring for a Triad of Particles. Checking the Transitivity of the Coloring Procedure
2.3. Kinematic Graphs Emerging from the Motion of Multi-Particle Systems
2.4. Generalization for Infinite Systems of Material Points
3. Discussion
4. Conclusions
Author Contributions
Funding
Data Availability Statement
Acknowledgments
Conflicts of Interest
References
- Wigner, The Unreasonable Effectiveness of Mathematics in the Natural Sciences, Mathematics and Science, World Scientific, Singapore, pp. 291-306, 1990.
- Grinbaum, A. The effectiveness of mathematics in physics of the unknown. Synthese 2019, 196, 973–989. [Google Scholar] [CrossRef]
- Plotnitsky, A. On the Reasonable and Unreasonable Effectiveness of Mathematics in Classical and Quantum Physics. Found. Phys, 2011, 41, 466–491. [Google Scholar] [CrossRef]
- Bondy, J. A.; Murty, U.S. R Graph Theory, Springer, New York, 2008.
- Bollobás, B. Modern graph theory, vol 184. Springer, Berlin, 2013.
- Kosowski, A. Manuszewski, K. Classical coloring of graphs, Contemporary Mathematics, 2008, 352, 1–20. [Google Scholar]
- Kano, M.; Li, X. Monochromatic and Heterochromatic Subgraphs in Edge-Colored Graphs - A Survey. Graphs & Combinatorics 2008, 24, 237–263. [Google Scholar]
- Chartrand, G.; Zhang, P. New directions in Ramsey theory, Discrete Math. Lett. 2021, 6, 84–96. [Google Scholar]
- Graham, R. L.; Rothschild, B.L. ; Spencer, J, H. Ramsey theory, 1990. [Google Scholar]
- Graham, R.; Butler, S. Rudiments of Ramsey Theory (2nd ed.). American Mathematical Society: Providence, Rhode Island, USA, 2015; pp. 7–46.
- Di Nasso, M.; Goldbring, I.; Lupini, M. , Nonstandard Methods in Combinatorial Number Theory, Lecture Notes in Mathematics, vol. 2239, Springer-Verlag, Berlin, 2019.
- Katz, M.; Reimann, J. Introduction to Ramsey Theory: Fast Functions, Infinity, and Metamathematics, Student Mathemati-cal Library Volume: 87; 2018; pp. 1-34.
- Erdős, P. Solved and unsolved problems in combinatorics and combinatorial number theory, Congressus Numerantium, 1981, 32, 49–62. 32.
- Conlon, J. Fox, B. Sudakov, Recent developments in graph Ramsey theory, Surveys in Combinatorics, 2015, 424, 49–118. [Google Scholar]
- de Gois, C.; Hansenne, K.; Gühne, O. Uncertainty relations from graph theory. Phys. Rev. A 2023, 107, 062211. [Google Scholar] [CrossRef]
- Xu, Z-P. ; Schwonnek, R.; Winter, A. Bounding the Joint Numerical Range of Pauli Strings by Graph Parameters. PRX Quantum 2024, 5, 020318. [Google Scholar] [CrossRef]
- Hansenne, K.; Qu, R.; Weinbrenner, L. T.; de Gois, C.; Wang, H.; Ming, Y.; Yang, Z.; Horodecki, P.; Gao, W.; Gühne, O. 2024; arXiv:2408.05730.
- Wouters, J.; Giotis, A.; Kang, R.; Schuricht, D.; Fritz, L. Lower bounds for Ramsey numbers as a statistical physics problem. J. Stat. Mech. 2022, 2022, 0332. [Google Scholar] [CrossRef]
- Shvalb, N.; Frenkel, M.; Shoval, Sh.; Bormashenko, *!!! REPLACE !!!* (Eds.) Dynamic Ramsey Theory of Mechanical Systems Forming a Complete Graph and Vibrations of Cyclic Compounds, Dynamics 2023, 3, 272-281. 3.
- Frenkel, M.; Shoval, Sh.; Bormashenko, *!!! REPLACE !!!* (Eds.) Fermat Principle, Ramsey Theory and Metamaterials. Materials 2023, 16, 7571. [Google Scholar] [CrossRef] [PubMed]
- Bormashenko, Ed.; Shvalb, N. A Ramsey-Theory-Based Approach to the Dynamics of Systems of Material Points. Dynamics 2024, 4, 845–854. [Google Scholar] [CrossRef]
- Michail, O. An introduction to temporal graphs: an algorithmic perspective, Internet Mathematics, 2016, 12, 239–280. 12.
- Michail, O.; Spirakis, P.G. Traveling salesman problems in temporal graphs, Theoretical Computer Science, 2016, 634, 1-23. 634.
- Erlebach, T.; Hoffmann, M.; Kammer, F. On temporal graph exploration, J. Computer & System Sciences, 2021, 119, 1–18. [Google Scholar]
- Choudum, S. A.; Ponnusamy, B. Ramsey numbers for transitive tournaments, Discrete Mathematics 1999, 206, 119–129. 206.
- Gilevich, A.; Shoval, Sh.; Nosonovsky, M.; Bormashenko, *!!! REPLACE !!!* (Eds.) , Converting Tessellations into Graphs: From Voronoi Tessellations to Complete Graphs, Mathematics 2024, 12, 2426. 12.
- Choudum, S.A. ; Ponnusamy,B. Ordered Ramsey numbers, Discrete Mathematics 2002, 247, 79–92. [Google Scholar]
- Li, Y.; Lin, Q. Elementary methods of the graph theory, Applied Mathematical Sciences. Springer, pp. 3-44, Cham, Switzerland, 2020.
- Ramsey, F. P. On a Problem of Formal Logic. In: Gessel, I., Rota, GC. (eds) Classic Papers in Combinatorics. Modern Birkhäuser Classics. Birkhäuser Boston, 2009, pp. 264-286.
- Wang, Y.; Yuan, Y.; Ma, Y.; Wang, G. Time-Dependent Graphs: Definitions, Applications, and Algorithms. Data Sci. Eng. 2019, 4, 352–366. [Google Scholar] [CrossRef]







Disclaimer/Publisher’s Note: The statements, opinions and data contained in all publications are solely those of the individual author(s) and contributor(s) and not of MDPI and/or the editor(s). MDPI and/or the editor(s) disclaim responsibility for any injury to people or property resulting from any ideas, methods, instructions or products referred to in the content. |
© 2025 by the authors. Licensee MDPI, Basel, Switzerland. This article is an open access article distributed under the terms and conditions of the Creative Commons Attribution (CC BY) license (http://creativecommons.org/licenses/by/4.0/).
