Related papers: Order in the chaos with examples from graph theory
For a partially ordered set $(A, \le)$, let $G_A$ be the simple, undirected graph with vertex set $A$ such that two vertices $a \neq b\in A$ are adjacent if either $a \le b$ or $b \le a$. We call $G_A$ the \emph{partial order graph} or…
As is well known, a graph is a mathematical object modeling the existence of a certain relation between pairs of elements of a given set. Therefore, it is not surprising that many of the first results concerning graphs made reference to…
The Fibonacci index of a graph is the number of its stable sets. This parameter is widely studied and has applications in chemical graph theory. In this paper, we establish tight upper bounds for the Fibonacci index in terms of the…
In this paper, we study various chaos of topological group or semigroup actions.
Through semiclassical methods the subject of quantum chaos motivates and depends on Hamiltonian chaos research. Presented here is a selection of Hamiltonian chaos topics that in this way get directly related to any of a variety of quantum…
Some possible (re)sources of indeterminism and randomness encountered in physics are enumerated. These gaps in the physical laws, if they exist, could possibly be exploited for dualistic interfaces. We also speculate that physical laws and…
The paper discusses the main ideas of the chaos theory and presents mainly the importance of the nonlinearities in the mathematical models. Chaos and order are apparently two opposite terms. The fact that in chaos can be found a certain…
A Random Graph is a random object which take its values in the space of graphs. We take advantage of the expressibility of graphs in order to model the uncertainty about the existence of causal relationships within a given set of variables.…
The interplay between groups and graphs have been the most famous and productive area of algebraic graph theory. In this paper, we introduce and study the graphs whose vertex set is group G such that two distinct vertices a and b having…
We study some percolation problems on the complete graph over $\mathbf N$. In particular, we give sharp sufficient conditions for the existence of (finite or infinite) cliques and paths in a random subgraph. No specific assumption on the…
An ordered graph $\mathcal{G}$ is a simple graph together with a total ordering on its vertices. The (2-color) Ramsey number of $\mathcal{G}$ is the smallest integer $N$ such that every 2-coloring of the edges of the complete ordered graph…
Given a hereditary graph property $\mathcal{P}$, consider distributions of random orderings of vertices of graphs $G\in\mathcal{P}$ that are preserved under isomorphisms and under taking induced subgraphs. We show that for many properties…
The scope of this teaching package is to make a brief introduction to some notions and properties of chaotic systems. We first make a brief introduction to chaos in general and then we show some important properties of chaotic systems using…
Morphogenesis, as it is understood in a wide sense by Ren\'e Thom, is considered for various types of chaos. That is, those, obtained by period-doubling cascade, Devaney's and Li-Yorke chaos. Moreover, in discussion form we consider…
Ramsey's Theorem states that a graph $G$ has bounded order if and only if $G$ contains no complete graph $K_n$ or empty graph $E_n$ as its induced subgraph. The Gy\'arf\'as-Sumner conjecture says that a graph $G$ has bounded chromatic…
We consider constrained variants of graph homomorphisms such as embeddings, monomorphisms, full homomorphisms, surjective homomorpshims, and locally constrained homomorphisms. We also introduce a new variation on this theme which derives…
We consider Gallai's graph Modular Decomposition theory for network analytics. On the one hand, by arguing that this is a choice tool for understanding structural and functional similarities among nodes in a network. On the other, by…
A theory of structure is formulated for systems of many structureless classical particles with stable local interactions in Euclidean space. Such systems are shown to have their structure in thermodynamic equilibrium determined exactly by a…
We study locally closed transformation monoids which contain the automorphism group of the random graph. We show that such a transformation monoid is locally generated by the permutations in the monoid, or contains a constant operation, or…
Motivated by his work on the classification of countable homogeneous oriented graphs, Cherlin asked about the typical structure of oriented graphs (i) without a transitive triangle, or (ii) without an oriented triangle. We give an answer to…