Let denote the complete 3‐uniform hypergraph on vertices and the 3‐uniform hypergraph on vertices consisting of all edges incident to a given vertex. Whereas many hypergraph Ramsey numbers grow either at most polynomially or at least exponentially, we show that the off‐diagonal Ramsey number exhibits an unusual intermediate growth rate, namely,
Note: When clicking on a Digital Object Identifier (DOI) number, you will be taken to an external site maintained by the publisher.
Some full text articles may not yet be available without a charge during the embargo (administrative interval).
What is a DOI Number?
Some links on this page may take you to nonfederal websites. Their policies may differ from this site.

Abstract for some positive constants and . The proof of these bounds brings in a novel Ramsey problem on grid graphs which may be of independent interest: what is the minimum such that any 2‐edge‐coloring of the Cartesian product contains either a red rectangle or a blue ? Free, publiclyaccessible full text available October 1, 2024 
Abstract We prove that the discrepancy of arithmetic progressions in the
d ‐dimensional grid is within a constant factor depending only ond of . This extends the case , which is a celebrated result of Roth and of Matoušek and Spencer, and removes the polylogarithmic factor from the previous upper bound of Valkó from about two decades ago. We further prove similarly tight bounds for grids of differing side lengths in many cases. 
Abstract The book graph $B_n ^{(k)}$ consists of $n$ copies of $K_{k+1}$ joined along a common $K_k$ . In the prequel to this paper, we studied the diagonal Ramsey number $r(B_n ^{(k)}, B_n ^{(k)})$ . Here we consider the natural offdiagonal variant $r(B_{cn} ^{(k)}, B_n^{(k)})$ for fixed $c \in (0,1]$ . In this more general setting, we show that an interesting dichotomy emerges: for very small $c$ , a simple $k$ partite construction dictates the Ramsey function and all nearlyextremal colourings are close to being $k$ partite, while, for $c$ bounded away from $0$ , random colourings of an appropriate density are asymptotically optimal and all nearlyextremal colourings are quasirandom. Our investigations also open up a range of questions about what happens for intermediate values of $c$ .more » « lessFree, publiclyaccessible full text available May 1, 2024

Abstract We prove that the number of edges of a multigraph with vertices is at most , provided that any two edges cross at most once, parallel edges are noncrossing, and the lens enclosed by every pair of parallel edges in contains at least one vertex. As a consequence, we prove the following extension of the Crossing Lemma of Ajtai, Chvátal, Newborn, Szemerédi, and Leighton, if has edges, in any drawing of with the above property, the number of crossings is . This answers a question of Kaufmann et al. and is tight up to the logarithmic factor.

Abstract For an oriented graph , let denote the size of a
minimum feedback arc set , a smallest edge subset whose deletion leaves an acyclic subgraph. Berger and Shor proved that any ‐edge oriented graph satisfies . We observe that if an oriented graph has a fixed forbidden subgraph , the bound is sharp as a function of if is not bipartite, but the exponent in the lower order term can be improved if is bipartite. Using a result of Bukh and Conlon on Turán numbers, we prove that any rational number in is optimal as an exponent for some finite family of forbidden subgraphs. Our upper bounds come equipped with randomized linear‐time algorithms that construct feedback arc sets achieving those bounds. We also characterize directed quasirandomness via minimum feedback arc sets. 
Celebrated theorems of Roth and of Matoušek and Spencer together show that the discrepancy of arithmetic progressions in the first $n$ positive integers is $\Theta (n^{1/4})$ . We study the analogous problem in the $\mathbb {Z}_n$ setting. We asymptotically determine the logarithm of the discrepancy of arithmetic progressions in $\mathbb {Z}_n$ for all positive integer $n$ . We further determine up to a constant factor the discrepancy of arithmetic progressions in $\mathbb {Z}_n$ for many $n$ . For example, if $n=p^k$ is a prime power, then the discrepancy of arithmetic progressions in $\mathbb {Z}_n$ is $\Theta (n^{1/3+r_k/(6k)})$ , where $r_k \in \{0,1,2\}$ is the remainder when $k$ is divided by $3$ . This solves a problem of Hebbinghaus and Srivastav.more » « less