Results 11 to 20 of about 157,651 (282)
Dynamics, 2023 Ramsey theory constitutes the dynamics of mechanical systems, which may be described as abstract complete graphs. We address a mechanical system which is completely interconnected by two kinds of ideal Hookean springs.
Nir Shvalb +3 more
doaj +1 more source
DID RAMSEY EVER ENDORSE A REDUNDANCY THEORY OF TRUTH?
Tópicos, 2013 This paper deals with Ramsey´s theory of truth and its aim is twofold: on the one hand, it will explain what position about truth Ramsey actually defended, and, on the other hand, we will pursue Ramsey’s insight in the XXth century.
María J. Frápolli
doaj +1 more source
Lines in Euclidean Ramsey theory [PDF]
, 2018 Let $\ell_m$ be a sequence of $m$ points on a line with consecutive points of distance one. For every natural number $n$, we prove the existence of a red/blue-coloring of $\mathbb{E}^n$ containing no red copy of $\ell_2$ and no blue copy of $\ell_m$ for ...
Conlon, David, Fox, Jacob
core +2 more sources
European Journal of Combinatorics, 1997 If \(G\) is a countable graph which has arbitrarily large cliques and the \(k\)-tuples of \(G\) are colored with a finite number of colors then there is an infinite chromatic subgraph on which the \(k\)-tuples get \(2^{k-1}\) colors. This is sharp if \(G\) does not contain infinite cliques.
Sauer, Norbert +2 more
openaire +2 more sources
Star-critical connected Ramsey numbers for 2-colorings of complete graphs [PDF]
Transactions on CombinatoricsThis paper builds upon Sumner's work by further investigating the concept of connected Ramsey numbers, specifically focusing on star-critical connected Ramsey numbers.
Monu Moun, Jagjeet Jakhar, Mark Budden
doaj +1 more source
Journal of Combinatorial Theory, Series A, 1974 AbstractA subset S of a group G is said to be a sum-free set if S ∩ (S + S) = ⊘. Such a set is maximal if for every sum-free set T ⊆ G, we have |T| ⩽ |S|. Here, we generalize this concept, defining a sum-free set S to be locally maximal if for every sum free set T such that S ⊆ T ⊆ G, we have S = T.
Street, Anne Penfold +1 more
openaire +2 more sources
Discrepancy of Products of Hypergraphs [PDF]
Discrete Mathematics & Theoretical Computer Science, 2005 For a hypergraph $\mathcal{H} = (V,\mathcal{E})$, its $d$―fold symmetric product is $\Delta^d \mathcal{H} = (V^d,\{ E^d | E \in \mathcal{E} \})$. We give several upper and lower bounds for the $c$-color discrepancy of such products.
Benjamin Doerr +2 more
doaj +1 more source
Fraisse Limits, Ramsey Theory, and Topological Dynamics of Automorphism Groups [PDF]
, 2004 We study in this paper some connections between the Fraisse theory of amalgamation classes and ultrahomogeneous structures, Ramsey theory, and topological dynamics of automorphism groups of countable structures.Comment: 73 pages, LaTeX 2e, to appear in ...
Kechris, A. S. +2 more
core +2 more sources
Discrete Mathematics, 1987 For positive integers k, \(\ell\), n let \(f_{\ell}(n,k)\) denote the least positive integer f such that for every family \({\mathcal F}\subseteq 2^ n\) of subsets of \(\{\) 1,...,n\(\}\) and for every k-coloring \(\Delta: \{1,...,n\}\to \{1,...,k\}\) there exists a chain \(F_ 1\varsubsetneq...\varsubsetneq F_{\ell +1}\) with \(F_ i\in {\mathcal F ...
Füredi, Zoltán +3 more
openaire +2 more sources
Discrete Mathematics, 2001 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Simonovits, Miklós, T. Sós, Vera
openaire +3 more sources