Results 31 to 40 of about 6,008,885 (289)
A Complexity Dichotomy in Spatial Reasoning via Ramsey Theory [PDF]
ACM Transactions on Computation Theory, 2020 Constraint satisfaction problems (CSPs) for first-order reducts of finitely bounded homogeneous structures form a large class of computational problems that might exhibit a complexity dichotomy, P versus NP-complete.
M. Bodirsky, Bertalan Bodor
semanticscholar +1 more source
A result in asymmetric Euclidean Ramsey theory [PDF]
Discrete Mathematics, 2017 Andrii Arman, Sergei Tsaturian
openalex +3 more sources
Constructions in Ramsey theory [PDF]
Journal of the London Mathematical Society, 2018 We provide several constructions for problems in Ramsey theory. First, we prove a superexponential lower bound for the classical 4-uniform Ramsey number $r_4(5,n)$, and the same for the iterated $(k-4)$-fold logarithm of the $k$-uniform version $r_k(k+1,n)$.
Andrew Suk, Dhruv Mubayi
openaire +4 more sources
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
Discrete Mathematics, 2001 AbstractRamsey- and Turán-type problems were always strongly related to each other. Motivated by an observation of Paul Erdős, it was Turán who started the systematic investigation of the applications of extremal graph theory in geometry and analysis.
Simonovits, Miklós, T. Sós, Vera
openaire +3 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
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
Amenability and Ramsey theory [PDF]
Fundamenta Mathematicae, 2013 18 pages. Section 6 was expanded to contain a generalization of the main results to automorphism groups of Fraisse structures.
openaire +3 more sources
European Journal of Pragmatism and American Philosophy, 2022 One of Frank Ramsey’s crucial contributions to philosophy is his theory of belief. Ramsey deals with the notion of full belief in “Facts and Propositions,” as well as that of degrees of belief in “Truth and Probability.” In his posthumously published manuscript OnTruth, Ramsey analyses beliefs and emphasizes the essential role of agent’s actions in his
openaire +4 more sources
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