Results 21 to 30 of about 9,543 (293)
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
More on lines in Euclidean Ramsey theory
Comptes Rendus. Mathématique, 2023 Let $\ell _m$ be a sequence of $m$ points on a line with consecutive points at distance one. Answering a question raised by Fox and the first author and independently by Arman and Tsaturian, we show that there is a natural number $m$ and a red/blue ...
Conlon, David, Wu, Yu-Han
doaj +1 more source
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.
Norbert Sauer +2 more
openaire +2 more sources
Ramsey Theory for Layered Semigroups [PDF]
The Electronic Journal of Combinatorics, 2021 We further develop the theory of layered semigroups, as introduced by Farah, Hindman and McLeod, providing a general framework to prove Ramsey statements about such a semigroup $S$. By nonstandard and topological arguments, we show Ramsey statements on $S$ are implied by the existence of coherent sequences in $S$.
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
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 ...
Zoltán Füredi +3 more
openaire +2 more sources
Diagonal Forms, Linear Algebraic Methods and Ramsey-Type Problems [PDF]
, 2013 This thesis focuses mainly on linear algebraic aspects of combinatorics. Let N_t(H) be an incidence matrix with edges versus all subhypergraphs of a complete hypergraph that are isomorphic to H. Richard M.
Wong, Wing Hong Tony
core +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 +3 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
Electronic Journal of Graph Theory and Applications, 2023 This paper begins by exploring some old and new results about Ramsey numbers and minimum numbers of monochromatic triangles in 2-colorings of complete graphs, both in the disjoint and non-disjoint cases.
Jamie Bishop +2 more
doaj +1 more source