Results 81 to 90 of about 6,526 (216)
Combinatorics on ideals and axiom A [PDF]
Journal of Symbolic Logic, 1994 Throughout this paper denotes a nonprincipal ultrafilter and ℐ denotes the dual ideal. ℙ(ℐ) is the poset of all partial functions p: ω → 2 such that dom(p) ∈ ℐ. In [2], Grigorieff proved that ω1 is preserved in the corresponding generic extension if and only if is a P-point.
openaire +3 more sources
On Tight Tree‐Complete Hypergraph Ramsey Numbers
Journal of Graph Theory, Volume 113, Issue 1, Page 88-96, September 2026.ABSTRACT Chvátal showed that for any tree T with k edges, the Ramsey number R ( T , n ) = k ( n − 1 ) + 1. For r = 3 or 4, we show that, if T is an r‐uniform nontrivial tight tree, then the hypergraph Ramsey number R ( T , n ) = Θ ( n r − 1 ). The 3‐uniform result comes from observing a construction of Cooper and Mubayi.
Jiaxi Nie
wiley +1 more source
Combinatorics of Periods in Strings
Journal of Combinatorial Theory, Series A, 2001 A preliminary version of this article was published in Lect. Notes Comput. Sci. 2076, 615--626 (2001; Zbl 0986.68101).
Eric Rivals, Sven Rahmann
openaire +4 more sources
Orientations of Graphs With at Most One Directed Path Between Every Pair of Vertices
Journal of Graph Theory, Volume 113, Issue 1, Page 143-164, September 2026.ABSTRACT Given a graph G, we say that an orientation D of G is a KT orientation if, for all u , v ∈ V ( D ), there is at most one directed path (in any direction) between u and v. Graphs that admit such orientations have been used to construct graphs with large chromatic number and small clique number that served as counterexamples to various ...
Barbora Dohnalová +3 more
wiley +1 more source
JTAM (Jurnal Teori dan Aplikasi Matematika)Rainbow vertex antimagic coloring is a novel concept in graph theory that combines rainbow vertex connection with antimagic labeling. Rainbow vertex connection is a vertex coloring where each vertex in a simple connected graph G=(V,E) is connected by a ...
Dafik Dafik +5 more
doaj +1 more source
Conflict-Free Vertex-Connections of Graphs
Discussiones Mathematicae Graph Theory, 2020 A path in a vertex-colored graph is called conflict-free if there is a color used on exactly one of its vertices. A vertex-colored graph is said to be conflict-free vertex-connected if any two vertices of the graph are connected by a conflict-free path ...
Li Xueliang +5 more
doaj +1 more source
Creativity and Innovation Management, Volume 35, Issue 3, Page 555-569, September 2026.ABSTRACT This paper explores the limits of mission‐directed entrepreneurial states by drawing on the theory of recombinant innovation and F.A. Hayek's insights on the spontaneous growth of knowledge in society. First, the use of discretionary policymaking curtails the range of knowledge generated in the process of social interaction, limiting the scope
Bryan Cheang, Praharsh Mehrotra
wiley +1 more source
Convergence and combinatorics of the Reverse algorithm
Bulletin of the London Mathematical Society, Volume 58, Issue 9, September 2026.Abstract We study the Reverse algorithm, a multidimensional continued fraction algorithm, which is not unimodular. We show that the Reverse algorithm is ergodic and, by proving that its second Lyapunov exponent is negative, that it is a.e. exponentially convergent.
Hiroaki Ito +2 more
wiley +1 more source