Results 31 to 40 of about 354 (57)
Large stars with few colors [PDF]
, 2012 A recent question in generalized Ramsey theory is that for fixed positive integers $s\leq t$, at least how many vertices can be covered by the vertices of no more than $s$ monochromatic members of the family $\cal F$ in every edge coloring of $K_n$ with $
Khamseh, Amir, Omidi, Gholam Reza
core
Ramsey Properties of Permutations [PDF]
, 2012 The age of each countable homogeneous permutation forms a Ramsey class. Thus, there are five countably infinite Ramsey classes of permutations.Comment: 10 pages, 3 figures; v2: updated info on related work + some other minor enhancements (Dec 21 ...
Böttcher, Julia, Foniok, Jan
core +1 more source
Topological methods in zero-sum Ramsey theory
Forum of Mathematics, SigmaA landmark result of Erdős, Ginzburg, and Ziv (EGZ) states that any sequence of $2n-1$ elements in ${\mathbb {Z}}/n$ contains a zero-sum subsequence of length n.
Florian Frick +7 more
doaj +1 more source
The Ramsey number of loose paths in 3-uniform hypergraphs [PDF]
, 2012 Recently, asymptotic values of 2-color Ramsey numbers for loose cycles and also loose paths were determined. Here we determine the 2-color Ramsey number of 3-uniform loose paths when one of the paths is significantly larger than the other: for every $n ...
Maherani, Leila +3 more
core
The weak Ramsey property and extreme amenability
Forum of Mathematics, SigmaWe extend the Kechris–Pestov–Todorčević correspondence to weak Fraïssé categories and automorphism groups of generic objects. The new ingredient is the weak Ramsey property.
Adam Bartoš +3 more
doaj +1 more source
Forum of Mathematics, SigmaWe introduce the notion of echeloned spaces – an order-theoretic abstraction of metric spaces. The first step is to characterize metrizable echeloned spaces. It turns out that morphisms between metrizable echeloned spaces are uniformly continuous or have
Maxime Gheysens +4 more
doaj +1 more source
Chromatic number of Euclidean plane
, 2015 If the chromatic number of Euclidean plane is larger than four, but it is known that the chromatic number of planar graphs is equal to four, then how does one explain it? In my opinion, they are contradictory to each other. This idea leads to confirm the
Wang, Kai-Rui
core
Infinite Lexicographic Products
, 2019 We generalize the lexicographic product of first-order structures by presenting a framework for constructions which, in a sense, mimic iterating the lexicographic product infinitely and not necessarily countably many times.
Meir, Nadav
core
Some of the next articles are maybe not open access.
Related searches:
Related searches:
A Note on Color-Bias Hamilton Cycles in Dense Graphs
SIAM Journal on Discrete Mathematics, 2021Andrew Treglown
exaly