We show that there is an absolute constant c > 0 c>0 such that the following holds. For every n > 1 n > 1 , there is a 5-uniform hypergraph on at least 2 2 c n 1 / 4 2^{2^{cn^{1/4}}} vertices with independence number at most n n , where every set of 6 vertices induces at most 3 edges. The double exponential growth rate for the number of vertices is sharp. By applying a stepping-up lemma established by the first two authors, analogous sharp results are proved for k k -uniform hypergraphs. This answers the penultimate open case of a conjecture in Ramsey theory posed by Erdős and Hajnal in 1972.
more »
« less
This content will become publicly available on April 15, 2025
Set-Coloring Ramsey Numbers via Codes
For positive integers 𝑛, 𝑟, 𝑠 with 𝑟 > 𝑠, the set-coloring Ramsey number 𝑅(𝑛; 𝑟, 𝑠) is the minimum 𝑁 such that if every edge of the complete graph 𝐾_𝑁 receives a set of 𝑠 colors from a palette of 𝑟 colors, then there is guaranteed to be a monochromatic clique on 𝑛 vertices, that is, a subset of 𝑛 vertices where all of the edges between them receive a common color. In particular, the case 𝑠 = 1 corresponds to the classical multicolor Ramsey number. We prove general upper and lower bounds on 𝑅(𝑛; 𝑟, 𝑠) which imply that 𝑅(𝑛; 𝑟, 𝑠) = 2^Θ(𝑛𝑟) if 𝑠/𝑟 is bounded away from 0 and 1. The upper bound extends an old result of Erdős and Szemerédi, who treated the case 𝑠 = 𝑟 − 1, while the lower bound exploits a connection to error-correcting codes. We also study the analogous problem for hypergraphs.
more »
« less
- PAR ID:
- 10536004
- Publisher / Repository:
- Akadémiai Kiadó
- Date Published:
- Journal Name:
- Studia Scientiarum Mathematicarum Hungarica
- Volume:
- 61
- Issue:
- 1
- ISSN:
- 0081-6906
- Page Range / eLocation ID:
- 1 to 15
- Format(s):
- Medium: X
- Sponsoring Org:
- National Science Foundation
More Like this
-
-
more » « less
The triangle‐free process begins with an empty graph on
n vertices and iteratively adds edges chosen uniformly at random subject to the constraint that no triangle is formed. We determine the asymptotic number of edges in the maximal triangle‐free graph at which the triangle‐free process terminates. We also bound the independence number of this graph, which gives an improved lower bound on the Ramsey numbersR (3,t ): we show, which is within a 4 + o (1) factor of the best known upper bound. Our improvement on previous analyses of this process exploits the self‐correcting nature of key statistics of the process. Furthermore, we determine which bounded size subgraphs are likely to appear in the maximal triangle‐free graph produced by the triangle‐free process: they are precisely those triangle‐free graphs with density at most 2. -
more » « less
An edge‐ordered graph is a graph with a linear ordering of its edges. Two edge‐ordered graphs are
equivalent if there is an isomorphism between them preserving the edge‐ordering. Theedge‐ordered Ramsey number r edge(H ;q ) of an edge‐ordered graphH is the smallestN such that there exists an edge‐ordered graphG onN vertices such that, for everyq ‐coloring of the edges ofG , there is a monochromatic subgraph ofG equivalent toH . Recently, Balko and Vizer proved thatr edge(H ;q ) exists, but their proof gave enormous upper bounds on these numbers. We give a new proof with a much better bound, showing there exists a constantc such thatfor every edge‐ordered graph H onn vertices. We also prove a polynomial bound for the edge‐ordered Ramsey number of graphs of bounded degeneracy. Finally, we prove a strengthening for graphs where every edge has a label and the labels do not necessarily have an ordering. -
more » « less
We introduce a graph Ramsey game called Ramsey, Paper, Scissors. This game has two players, Proposer and Decider. Starting from an empty graph on
n vertices, on each turn Proposer proposes a potential edge and Decider simultaneously decides (without knowing Proposer's choice) whether to add it to the graph. Proposer cannot propose an edge which would create a triangle in the graph. The game ends when Proposer has no legal moves remaining, and Proposer wins if the final graph has independence number at leasts . We prove a threshold phenomenon exists for this game by exhibiting randomized strategies for both players that are optimal up to constants. Namely, there exist constants 0 <A <B such that (under optimal play) Proposer wins with high probability if, while Decider wins with high probability if . This is a factor of larger than the lower bound coming from the off‐diagonal Ramsey number r (3,s ). -
We explicitly construct an extractor for two independent sources on 𝑛 bits, each with min-entropy at least log𝐶𝑛 for a large enough constant 𝐶. Our extractor outputs one bit and has error 𝑛−Ω(1). The best previous extractor, by Bourgain, required each source to have min-entropy .499𝑛. A key ingredient in our construction is an explicit construction of a monotone, almost-balanced Boolean function on 𝑛 bits that is resilient to coalitions of size 𝑛1−𝛿 for any 𝛿>0. In fact, our construction is stronger in that it gives an explicit extractor for a generalization of non-oblivious bit-fixing sources on 𝑛 bits, where some unknown 𝑛−𝑞 bits are chosen almost polylog(𝑛)-wise independently, and the remaining 𝑞=𝑛1−𝛿 bits are chosen by an adversary as an arbitrary function of the 𝑛−𝑞 bits. The best previous construction, by Viola, achieved 𝑞=𝑛1/2–𝛿. Our explicit two-source extractor directly implies an explicit construction of a 2(loglog𝑁)𝑂(1)-Ramsey graph over 𝑁 vertices, improving bounds obtained by Barak et al. and matching an independent work by Cohen.more » « less
