Results 1 to 10 of about 73 (70)
Ramsey theory and thermodynamics
Re-shaping of thermodynamics with the graph theory and Ramsey theory is suggested. Maps built of thermodynamic states are addressed. Thermodynamic states may be attainable and non-attainable by the thermodynamic process in the system of constant mass. We
Nir Shvalb +3 more
doaj +3 more sources
Ramsey theory constitutes the dynamics of mechanical systems, which may be described as abstract complete graphs. We address a mechanical system which is completely interconnected by two kinds of ideal Hookean springs.
Nir Shvalb +3 more
doaj +3 more sources
A Note on the Geometry of Closed Loops
In this paper, we utilize the Ramsey theory to investigate the geometrical characteristics of closed contours. We begin by examining a set of six points arranged on a closed contour and connected as a complete graph. We assign the downward-pointing edges
Nir Shvalb +3 more
doaj +1 more source
A note on the Ramsey numbers for theta graphs versus the wheel of order 5
The study of exact values and bounds on the Ramsey numbers of graphs forms an important family of problems in the extremal graph theory. For a set of graphs S and a graph F , the Ramsey number R (S , F) is the smallest positive integer r such that for ...
Mohammed M.M. Jaradat +3 more
doaj +2 more sources
Ramsey numbers of partial order graphs (comparability graphs) and implications in ring theory
For a partially ordered set (A,≤)(A,\le ), let GA{G}_{A} be the simple, undirected graph with vertex set A such that two vertices a≠b∈Aa\ne b\in A are adjacent if either a≤ba\le b or b≤ab\le a.
Badawi Ayman, Rissner Roswitha
doaj +1 more source
Gallai-Ramsey Numbers for Rainbow S3+S_3^ + and Monochromatic Paths
Motivated by Ramsey theory and other rainbow-coloring-related problems, we consider edge-colorings of complete graphs without rainbow copy of some fixed subgraphs.
Li Xihe, Wang Ligong
doaj +1 more source
Singular Turán Numbers and Worm-Colorings
A subgraph G of H is singular if the vertices of G either have the same degree in H or have pairwise distinct degrees in H. The largest number of edges of a graph on n vertices that does not contain a singular copy of G is denoted by TS(n, G).
Gerbner Dániel +3 more
doaj +1 more source
Star-critical connected Ramsey numbers for 2-colorings of complete graphs [PDF]
This paper builds upon Sumner's work by further investigating the concept of connected Ramsey numbers, specifically focusing on star-critical connected Ramsey numbers.
Monu Moun, Jagjeet Jakhar, Mark Budden
doaj +1 more source
Analysis of Student Reversible Thinking Skills on Graph Concept
The ability of reversible thinking in mathematics has less attention, but most of the mathematical subject is reversible. This type of research was qualitative descriptive which aimed to analyze student’s reversible thinking skills on the graph concept ...
Sugeng Sutiarso
doaj +1 more source
Graphs, friends and acquaintances
A graph is a mathematical object modeling the existence of a certain relation between pairs of elements of a given set. Many of the first results concerning graphs made reference to relationships between groups of people.
Cristina Dalfo, Miquel Àngel Fiol
doaj +1 more source

