Results 1 to 10 of about 157,308 (292)
Modeling of Complex Systems by Means of Partial Algebras
Mendel, 2019 Complex systems are very hard to describe by some unified language and calculus. In cases when their nature is very heterogeneous is possible to use with advantage state description.
Jiri Bila +2 more
doaj +1 more source
Density theorems for bipartite graphs and related Ramsey-type results
, 2007 In this paper, we present several density-type theorems which show how to find a copy of a sparse bipartite graph in a graph of positive density.
Fox, Jacob, Sudakov, Benny
core +4 more sources
The weak Ramsey property and extreme amenability
Forum of Mathematics, SigmaWe extend the Kechris–Pestov–Todorčević correspondence to weak Fraïssé categories and automorphism groups of generic objects. The new ingredient is the weak Ramsey property.
Adam Bartoš +3 more
doaj +1 more source
Intertemporal Complementarity and Optimality: A Study of a Two-Dimensional Dynamical System [PDF]
We study the underlying structure of the two-dimensional dynamical system generated by a class of dynamic optimization models, which allow for intertemporal complementarily between adjacent periods, but which preserve the time additively separable ...
Kazuo Nishimura, Tapan Mitra
core
Discrete & Computational Geometry, 1996 Let \((K_n, E_n)\) be a sequence of graphs in Euclidean spaces \(\mathbb{R}^n\). It is said to be edge-Ramsey if, for all \(r\geq 1\), a positive integer \(n= n(K, E, r)\) exists so that if \(m\geq n\), for any \(r\)-coloring of the edges of \(\mathbb{R}^m\), there is a graph \((L, F)\) in \(\mathbb{R}^m\) which is geometrically congruent to \((K_m ...
openaire +1 more source
A ramsey-type theorem for multiple disjoint copies of induced subgraphs
Discussiones Mathematicae Graph Theory, 2014 Let k and ℓ be positive integers with ℓ ≤ k − 2. It is proved that there exists a positive integer c depending on k and ℓ such that every graph of order (2k−1−ℓ/k)n+c contains n vertex disjoint induced subgraphs, where these subgraphs are isomorphic to ...
Nakamigawa Tomoki
doaj +1 more source
Monochromatic Graph Decompositions Inspired by Anti-Ramsey Theory and Parity Constraints
MathematicsWe open here many new tracks of research in anti-Ramsey Theory, considering edge-coloring problems inspired by rainbow coloring and further by odd colorings and conflict-free colorings. Let G be a graph and F any given family of graphs. For every integer
Yair Caro, Zsolt Tuza
doaj +1 more source
New Journal of Physics, 2018 We present an optimized scheme for nanoscale measurements of temperature in a complex environment using the nitrogen-vacancy center in nanodiamonds (NDs).
Philipp Konzelmann +11 more
doaj +1 more source
European Journal of CombinatoricsGiven a metric space $\mathcal{M}$ that contains at least two points, the chromatic number $χ\left(\mathbb{R}^n_{\infty}, \mathcal{M} \right)$ is defined as the minimum number of colours needed to colour all points of an $n$-dimensional space $\mathbb{R}^n_{\infty}$ with the max-norm such that no isometric copy of $\mathcal{M}$ is monochromatic.
Frankl, Nóra +2 more
openaire +3 more sources