Related papers: Order in the chaos with examples from graph theory
We introduce the notion of a graph derangement, which naturally interpolates between perfect matchings and Hamiltonian cycles. We give a necessary and sufficient condition for the existence of graph derangements on a locally finite graph.…
We present a unified approach to proving Ramsey-type theorems for graphs with a forbidden induced subgraph which can be used to extend and improve the earlier results of Rodl, Erdos-Hajnal, Promel-Rodl, Nikiforov, Chung-Graham, and…
Collective behavior is studied in globally coupled maps with distributed nonlinearity. It is shown that the heterogeneity enhances regularity in the collective dynamics. Low-dimensional quasiperiodic motion is often found for the…
The random ordered graph is the up to isomorphism unique countable homogeneous linearly ordered graph that embeds all finite linearly ordered graphs. We determine the reducts of the random ordered graph up to first-order interdefinability.
Let $G$ be a graph obtained as the union of some $n$-vertex graph $H_n$ with minimum degree $\delta(H_n)\geq\alpha n$ and a $d$-dimensional random geometric graph $G^d(n,r)$. We investigate under which conditions for $r$ the graph $G$ will…
We study structural conditions in dense graphs that guarantee the existence of vertex-spanning substructures such as Hamilton cycles. It is easy to see that every Hamiltonian graph is connected, has a perfect fractional matching and,…
Topological order in two-dimensional systems is studied by combining the braid group formalism with a gauge invariance analysis. We show that flux insertions (or large gauge transformations) pertinent to the toroidal topology induce…
Many physical theories like chaos theory are fundamentally concerned with the conceptual tension between determinism and randomness. Kolmogorov complexity can express randomness in determinism and gives an approach to formulate chaotic…
We study Hamiltonian paths and cycles in undirected graphs from an operadic viewpoint. We show that the graphical collection $\mathsf{Ham}$ encoding directed Hamiltonian paths in connected graphs admits an operad-like structure, called a…
The time needed to exchange information in the physical world induces a delay term when the respective system is modeled by differential equations. Time delays are hence ubiquitous, being furthermore likely to induce instabilities and with…
We enumerate labelled and unlabelled Hamiltonian cycles in complete $n$-partite graphs $K_{d,d,\ldots,d}$ having exactly $d$ vertices in each part (in other words, Tur\'an graphs $T(nd, n))$. We obtain recurrence relations that allow us to…
An ordered graph is a graph whose vertex set is equipped with a total order. The ordered complete graph $K_N^<$ is the complete graph with vertex set $[N]$ equipped with the natural ordering of the integers. Given an ordered graph $H$, the…
Several mechanisms have been proposed to explain the spontaneous generation of self-organized patterns, hypothesised to play a role in the formation of many of the magnificent patterns observed in Nature. In several cases of interest, the…
Arithmetical structures on a graph were introduced by Lorenzini as some intersection matrices that arise in the study of degenerating curves in algebraic geometry. In this article we study these arithmetical structures, in particular we are…
Introduced in the mid-1970's as an intermediate step in proving a long-standing conjecture on arithmetic progressions, Szemer\'edi's regularity lemma has emerged over time as a fundamental tool in different branches of graph theory,…
High-order structures have been recognised as suitable models for systems going beyond the binary relationships for which graph models are appropriate. Despite their importance and surge in research on these structures, their random cases…
Chaos as typical property of non-linear systems has revealed its crucial role in various problems of astrophysics and cosmology. The problems discussed at these lectures include planetary dynamics, galactic dynamics, reconstruction of the…
In a random linear graph, vertices are points on a line, and pairs of vertices are connected, independently, with a link probability that decreases with distance. We study the problem of reconstructing the linear embedding from the graph,…
Let G be a finite graph with the non-k-order property (essentially, a uniform finite bound on the size of an induced sub-half-graph). A major result of the paper applies model-theoretic arguments to obtain a stronger version of…
In this paper we will provide an introductory understanding of random graph models, and matchings in the case of Erdos-Renyi random graphs. We will provide a synthesis of background theory to this end. We will further examine pertinent…