Results 21 to 30 of about 787 (166)
Online Ramsey Theory for Planar Graphs [PDF]
The Electronic Journal of Combinatorics, 2014 An online Ramsey game $(G,\mathcal{H})$ is a game between Builder and Painter, alternating in turns. During each turn, Builder draws an edge, and Painter colors it blue or red. Builder's goal is to force Painter to create a monochromatic copy of $G$, while Painter's goal is to prevent this.
openaire +2 more sources
Phase Transition as an Emergent Phenomenon Analysed by Violation of Structural Invariant (M, BM)
Mendel, 2020 When modeling complex systems, we usually encounter the following difficulties: partiality, large amounts of data and uncertainty of conclusions. The most common approach used for modeling is the physical approach, sometimes reinforced by statistical ...
Jiri Bila, Ali H Reshak, Jan Chysky
doaj +1 more source
Capacity of Spaces of Properties Formulae, Approximations and Qualitative Shapes
Mendel, 2018 This article focuses on the exploration of spaces and models in which we describe the behavior of complex systems as special shapes. We understand these shapes both as a configuration of properties and their values, and on the other, as the formation of ...
Jiri Bila
doaj +1 more source
Modeling Complex Systems by Structural Invariants Approach
Complexity, 2021 When modeling complex systems, we usually encounter the following difficulties: partiality, large amount of data, and uncertainty of conclusions. It can be said that none of the known approaches solves these difficulties perfectly, especially in cases ...
Jiri Bila, Ali. H. Reshak, Jan Chysky
doaj +1 more source
Geometric random graphs and Rado sets of continuous functions
Discrete Analysis, 2021 Geometric random graphs and Rado sets of continuous functions, Discrete Analysis 2021:3, 21 pp. For several reasons, random graphs play a central role in the theory of finite graphs.
Anthony Bonato +2 more
doaj +1 more source
Two problems in graph Ramsey theory
European Journal of Combinatorics, 2022 We study two problems in graph Ramsey theory. In the early 1970's, Erdős and O'Neil considered a generalization of Ramsey numbers. Given integers $n,k,s$ and $t$ with $n \ge k \ge s,t \ge 2$, they asked for the least integer $N=f_k(n,s,t)$ such that in any red-blue coloring of the $k$-subsets of $\{1, 2,\ldots, N\}$, there is a set of size $n$ such ...
openaire +2 more sources
Online Ramsey theory for a triangle on ‐free graphs [PDF]
Journal of Graph Theory, 2019 AbstractGiven a class of graphs and a fixed graph , the online Ramsey game for H on is a game between two players Builder and Painter as follows: an unbounded set of vertices is given as an initial state, and on each turn Builder introduces a new edge with the constraint that the resulting graph must be in , and Painter colors the new edge either red
Ho-Jin Choi +3 more
openaire +3 more sources
Around a conjecture of Erdos in graph Ramsey theory
پژوهشهای ریاضی, 2021 For given graphs G1 and G2 the Ramsey number R(G1;G2), is the smallest positive integer n such that each blue-red edge coloring of the complete graph Kn contains a blue copy of G1 or a red copy of G2. In 1983, Erd}os conjectured that there is an absolute
Leila Maherani, Gholamreza Omidi
doaj
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 of monochromatic infinite subgraphs II
Forum of Mathematics, SigmaIn 1967, Gerencsér and Gyárfás [16] proved a result which is considered the starting point of graph-Ramsey theory: In every 2-coloring of $K_n$ , there is a monochromatic path on $\lceil (2n+1)/3\rceil $ vertices, and this is best possible ...
Jan Corsten +2 more
doaj +1 more source