相关论文: Order in the chaos with examples from graph theory
The problem of Turing pattern formation has attracted much attention in nonlinear science as well as physics, chemistry and biology. So far all Turing patterns have been observed in stationary and oscillatory media only. In this letter we…
We present a refinement of Ramsey numbers by considering graphs with a partial ordering on their vertices. This is a natural extension of the ordered Ramsey numbers. We formalize situations in which we can use arbitrary families of…
This paper formulates a new approach to the study of chaos in discrete dynamical systems based on the notions of inverse ill-posed problems, set-valued mappings, generalized and multivalued inverses, graphical convergence of a net of…
Order and symmetry are main structural principles in mathematics. We give five examples where on the face of it order is not apparent, but deeper investigations reveal that they are governed by order structures. These examples are finite…
In recent years there has been much progress in graph theory on questions of the following type. What is the threshold for a certain large substructure to appear in a random graph? When does a random graph contain all structures from a…
Random intersection graphs have received much interest and been used in diverse applications. They are naturally induced in modeling secure sensor networks under random key predistribution schemes, as well as in modeling the topologies of…
Datasets from several domains, such as life-sciences, semantic web, machine learning, natural language processing, etc. are naturally structured as acyclic graphs. These datasets, particularly those in bio-informatics and computational…
We investigate a method of generating a graph $G=(V,E)$ out of an ordered list of $n$ distinct real numbers $a_1, \dots, a_n$. These graphs can be used to test for the presence of interesting structure in the sequence. We describe sequences…
We develop a new technique that allows us to show in a unified way that many well-known combinatorial theorems, including Tur\'an's theorem, Szemer\'edi's theorem and Ramsey's theorem, hold almost surely inside sparse random sets. For…
We consider vertex decompositions of (di)graphs which appear in Automata Theory, and establish some their properties. Then we apply them to the problem of forbidden subgraphs.
In this paper we initiate a systematic study of the Tur\'an problem for edge-ordered graphs. A simple graph is called $\textit{edge-ordered}$, if its edges are linearly ordered. An isomorphism between edge-ordered graphs must respect the…
In this thesis we consider ordered graphs (that is, graphs with a fixed linear ordering on their vertices). We summarize and further investigations on the number of edges an ordered graph may have while avoiding a fixed forbidden ordered…
The class of closed graphs by a linear ordering on their sets of vertices is investigated. A recent characterization of such a class of graphs is analyzed by using tools from the proper interval graph theory.
An ordered graph is a pair $\mathcal{G}=(G,\prec)$ where $G$ is a graph and $\prec$ is a total ordering of its vertices. The ordered Ramsey number $\overline{R}(\mathcal{G})$ is the minimum number $N$ such that every ordered complete graph…
Graphs are used in many disciplines to model the relationships that exist between objects in a complex discrete system. Researchers may wish to compare a network of interest to a "typical" graph from a family (or ensemble) of graphs which…
We give several results showing that different discrete structures typically gain certain spanning substructures (in particular, Hamilton cycles) after a modest random perturbation. First, we prove that adding linearly many random edges to…
Graph theory provides fundamental concepts for many fields of science like statistical physics, network analysis and theoretical computer science. Here we give a pedagogical introduction to graph theory, divided into three sections. In the…
We describe some highlights in the theory of chaos, that started with Poincare (1899). Generic systems have both ordered and chaotic domains. Chaos appears mainly near un- stable periodic orbits. Large chaotic domains are due to resonance…
In this note we study graphs $G_r$ with the property that every colouring of $E(G_r)$ with $r+1$ colours admits a copy of some graph $H$ using at most $r$ colours. For $1\le r\le e(H)$ such graphs occur naturally at intermediate steps in…
Dynamical chaos is a term that encompasses a wide range of nonlinear phenomena such as turbulence, neuronal avalanches, weather patterns, and many others. However, despite much work in the field of chaos, its fundamental physical origin…