Abstract The theory of forbidden 0–1 matrices generalizes Turán-style (bipartite) subgraph avoidance, Davenport-Schinzel theory, and Zarankiewicz-type problems, and has been influential in many areas, such as discrete and computational geometry, the analysis of self-adjusting data structures, and the development of the graph parametertwin width. The foremost open problem in this area is to resolve thePach-Tardos conjecturefrom 2005, which states that if a forbidden pattern$$P\in \{0,1\}^{k\times l}$$ isacyclic, meaning it is the bipartite incidence matrix of a forest, then$$\operatorname {Ex}(P,n) = O(n\log ^{C_P} n)$$ , where$$\operatorname {Ex}(P,n)$$ is the maximum number of 1s in aP-free$$n\times n$$ 0–1 matrix and$$C_P$$ is a constant depending only onP. This conjecture has been confirmed on many small patterns, specifically allPwith weight at most 5, and all but two with weight 6. The main result of this paper is a clean refutation of the Pach-Tardos conjecture. Specifically, we prove that$$\operatorname {Ex}(S_0,n),\operatorname {Ex}(S_1,n) \ge n2^{\Omega (\sqrt{\log n})}$$ , where$$S_0,S_1$$ are the outstanding weight-6 patterns. We also prove sharp bounds on the entire class ofalternatingpatterns$$(P_t)$$ , specifically that for every$$t\ge 2$$ ,$$\operatorname {Ex}(P_t,n)=\Theta (n(\log n/\log \log n)^t)$$ . This is the first proof of an asymptotically sharp bound that is$$\omega (n\log n)$$ .
more »
« less
Polynomial Bounds for Chromatic Number. IV: A Near-polynomial Bound for Excluding the Five-vertex Path
Abstract A graphGisH-freeif it has no induced subgraph isomorphic toH. We prove that a$$P_5$$ -free graph with clique number$$\omega \ge 3$$ has chromatic number at most$$\omega ^{\log _2(\omega )}$$ . The best previous result was an exponential upper bound$$(5/27)3^{\omega }$$ , due to Esperet, Lemoine, Maffray, and Morel. A polynomial bound would imply that the celebrated Erdős-Hajnal conjecture holds for$$P_5$$ , which is the smallest open case. Thus, there is great interest in whether there is a polynomial bound for$$P_5$$ -free graphs, and our result is an attempt to approach that.
more »
« less
- Award ID(s):
- 2154169
- PAR ID:
- 10517553
- Publisher / Repository:
- Springer Link
- Date Published:
- Journal Name:
- Combinatorica
- Volume:
- 43
- Issue:
- 5
- ISSN:
- 0209-9683
- Page Range / eLocation ID:
- 845 to 852
- Subject(s) / Keyword(s):
- Chromatic number, Induced subgraphs
- Format(s):
- Medium: X
- Sponsoring Org:
- National Science Foundation
More Like this
-
-
Abstract In this paper we prove a higher dimensional analogue of Carleson’s$$\varepsilon ^{2}$$ conjecture. Given two arbitrary disjoint Borel sets$$\Omega ^{+},\Omega ^{-}\subset \mathbb{R}^{n+1}$$ , and$$x\in \mathbb{R}^{n+1}$$ ,$$r>0$$ , we denote$$ \varepsilon _{n}(x,r) := \frac{1}{r^{n}}\, \inf _{H^{+}} \mathcal{H}^{n} \left ( ((\partial B(x,r)\cap H^{+}) \setminus \Omega ^{+}) \cup (( \partial B(x,r)\cap H^{-}) \setminus \Omega ^{-})\right ), $$ where the infimum is taken over all open affine half-spaces$$H^{+}$$ such that$$x \in \partial H^{+}$$ and we define$$H^{-}= \mathbb{R}^{n+1} \setminus \overline{H^{+}}$$ . Our first main result asserts that the set of points$$x\in \mathbb{R}^{n+1}$$ where$$ \int _{0}^{1} \varepsilon _{n}(x,r)^{2} \, \frac{dr}{r}< \infty $$ is$$n$$ -rectifiable. For our second main result we assume that$$\Omega ^{+}$$ ,$$\Omega ^{-}$$ are open and that$$\Omega ^{+}\cup \Omega ^{-}$$ satisfies the capacity density condition. For each$$x \in \partial \Omega ^{+} \cup \partial \Omega ^{-}$$ and$$r>0$$ , we denote by$$\alpha ^{\pm }(x,r)$$ the characteristic constant of the (spherical) open sets$$\Omega ^{\pm }\cap \partial B(x,r)$$ . We show that, up to a set of$$\mathcal{H}^{n}$$ measure zero,$$x$$ is a tangent point for both$$\partial \Omega ^{+}$$ and$$\partial \Omega ^{-}$$ if and only if$$ \int _{0}^{1} \min (1,\alpha ^{+}(x,r) + \alpha ^{-}(x,r) -2) \frac{dr}{r} < \infty . $$ The first result is new even in the plane and the second one improves and extends to higher dimensions the$$\varepsilon ^{2}$$ conjecture of Carleson.more » « less
-
Abstract A family ofrdistinct sets$$\{A_1,\ldots , A_r\}$$ is anr-sunflower if for all$$1 \leqslant i < j\leqslant r$$ and$$1 \leqslant i' < j'\leqslant r$$ , we have$$A_i\cap A_j = A_{i'}\cap A_{j'}$$ . Erdős and Rado conjectured in 1960 that every family$$\mathcal {H}$$ of$$\ell $$ -element sets of size at least$$K(r)^\ell $$ contains anr-sunflower, whereK(r) is some function that depends only onr. We prove that if$$\mathcal {H}$$ is a family of$$\ell $$ -element sets of VC-dimension at mostdand$$|\mathcal H| > (C r(\log d+\log ^*\ell ))^\ell $$ for some absolute constant$$C > 0$$ , then$$\mathcal {H}$$ contains anr-sunflower. This improves a recent result of Fox, Pach, and Suk. When$$d=1$$ , we obtain a sharp bound, namely that$$|\mathcal H| > (r-1)^\ell $$ is sufficient. Along the way, we establish a strengthening of the Kahn–Kalai conjecture for set families of bounded VC-dimension, which is of independent interest.more » « less
-
Abstract LetXbe ann-element point set in thek-dimensional unit cube$$[0,1]^k$$ where$$k \ge 2$$ . According to an old result of Bollobás and Meir (Oper Res Lett 11:19–21, 1992) , there exists a cycle (tour)$$x_1, x_2, \ldots , x_n$$ through thenpoints, such that$$\left( \sum _{i=1}^n |x_i - x_{i+1}|^k \right) ^{1/k} \le c_k$$ , where$$|x-y|$$ is the Euclidean distance betweenxandy, and$$c_k$$ is an absolute constant that depends only onk, where$$x_{n+1} \equiv x_1$$ . From the other direction, for every$$k \ge 2$$ and$$n \ge 2$$ , there existnpoints in$$[0,1]^k$$ , such that their shortest tour satisfies$$\left( \sum _{i=1}^n |x_i - x_{i+1}|^k \right) ^{1/k} = 2^{1/k} \cdot \sqrt{k}$$ . For the plane, the best constant is$$c_2=2$$ and this is the only exact value known. Bollobás and Meir showed that one can take$$c_k = 9 \left( \frac{2}{3} \right) ^{1/k} \cdot \sqrt{k}$$ for every$$k \ge 3$$ and conjectured that the best constant is$$c_k = 2^{1/k} \cdot \sqrt{k}$$ , for every$$k \ge 2$$ . Here we significantly improve the upper bound and show that one can take$$c_k = 3 \sqrt{5} \left( \frac{2}{3} \right) ^{1/k} \cdot \sqrt{k}$$ or$$c_k = 2.91 \sqrt{k} \ (1+o_k(1))$$ . Our bounds are constructive. We also show that$$c_3 \ge 2^{7/6}$$ , which disproves the conjecture for$$k=3$$ . Connections to matching problems, power assignment problems, related problems, including algorithms, are discussed in this context. A slightly revised version of the Bollobás–Meir conjecture is proposed.more » « less
-
Abstract Given a prime powerqand$$n \gg 1$$ , we prove that every integer in a large subinterval of the Hasse–Weil interval$$[(\sqrt{q}-1)^{2n},(\sqrt{q}+1)^{2n}]$$ is$$\#A({\mathbb {F}}_q)$$ for some ordinary geometrically simple principally polarized abelian varietyAof dimensionnover$${\mathbb {F}}_q$$ . As a consequence, we generalize a result of Howe and Kedlaya for$${\mathbb {F}}_2$$ to show that for each prime powerq, every sufficiently large positive integer is realizable, i.e.,$$\#A({\mathbb {F}}_q)$$ for some abelian varietyAover$${\mathbb {F}}_q$$ . Our result also improves upon the best known constructions of sequences of simple abelian varieties with point counts towards the extremes of the Hasse–Weil interval. A separate argument determines, for fixedn, the largest subinterval of the Hasse–Weil interval consisting of realizable integers, asymptotically as$$q \rightarrow \infty $$ ; this gives an asymptotically optimal improvement of a 1998 theorem of DiPippo and Howe. Our methods are effective: We prove that if$$q \le 5$$ , then every positive integer is realizable, and for arbitraryq, every positive integer$$\ge q^{3 \sqrt{q} \log q}$$ is realizable.more » « less
An official website of the United States government

