Zobrazeno 1 - 10
of 46
pro vyhledávání: '"Andrew Suk"'
Publikováno v:
Proceedings of the American Mathematical Society. 150:3675-3685
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
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::8253c3f362a29c9fbf206a3e19090a1a
https://doi.org/10.1090/proc/15839
https://doi.org/10.1090/proc/15839
Autor:
Andrew Suk, Ji Zeng
Publikováno v:
Lecture Notes in Computer Science ISBN: 9783031222023
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::e11d3c151935ea01a593936ac69843be
https://doi.org/10.1007/978-3-031-22203-0_1
https://doi.org/10.1007/978-3-031-22203-0_1
Let $K_m^{(3)}$ denote the complete $3$-uniform hypergraph on $m$ vertices and $S_n^{(3)}$ the $3$-uniform hypergraph on $n+1$ vertices consisting of all $\binom{n}{2}$ edges incident to a given vertex. Whereas many hypergraph Ramsey numbers grow eit
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::d6de1b84250c054f6f6d454489d47333
http://arxiv.org/abs/2210.03545
http://arxiv.org/abs/2210.03545
Autor:
Andrew Suk, István Tomon
Publikováno v:
Bulletin of the London Mathematical Society, 53 (3)
For every positive integer $n$, we construct a Hasse diagram with $n$ vertices and chromatic number $\Omega(n^{1/4})$, which significantly improves on the previously known best constructions of Hasse diagrams having chromatic number $\Theta(\log n)$.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::131126d8bb2a69d861e6c1123c03459b
https://doi.org/10.1112/blms.12457
https://doi.org/10.1112/blms.12457
Publikováno v:
Israel Journal of Mathematics. 239:39-57
We consider m-colorings of the edges of a complete graph, where each color class is defined semi-algebraically with bounded complexity. The case m = 2 was first studied by Alon et al., who applied this framework to obtain surprisingly strong Ramsey-t
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::ae826b7f489c75ab0b84f917bc4e62a4
https://doi.org/10.1007/s11856-020-2042-8
https://doi.org/10.1007/s11856-020-2042-8
Autor:
Andrew Suk, Dhruv Mubayi
Publikováno v:
Journal of the European Mathematical Society. 22:1247-1259
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::1400b1edb7cb58e75c8bd0cab9e8dc2a
https://doi.org/10.4171/jems/944
https://doi.org/10.4171/jems/944
Autor:
Andrew Suk, Dhruv Mubayi
Publikováno v:
Mathematika. 65:702-707
Motivated by the Erdős–Szekeres convex polytope conjecture in , we initiate the study of the following induced Ramsey problem for hypergraphs. Given integers , what is the minimum integer such that any -uniform hypergraph on vertices with the prop
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::05e429bf5dc37730d9eafb62e870b777
https://doi.org/10.1112/s0025579319000135
https://doi.org/10.1112/s0025579319000135
Publikováno v:
Combinatorica
In 1916, Schur introduced the Ramsey number r(3;m), which is the minimum integer n > 1 such that for any m-coloring of the edges of the complete graph K_n, there is a monochromatic copy of K₃. He showed that r(3;m) ≤ O(m!), and a simple construct
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::85e73200bda74d617325a3cba1184e77
Autor:
Dhruv Mubayi, Andrew Suk
Publikováno v:
Springer Optimization and Its Applications ISBN: 9783030558567
The classical hypergraph Ramsey number rk(s, n) is the minimum N such that for every red-blue coloring of the k-tuples of {1, …, N}, there are s integers such that every k-tuple among them is red, or n integers such that every k-tuple among them is
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::bee8e83a172944e4a90bbcd0f0bf38de
https://doi.org/10.1007/978-3-030-55857-4_16
https://doi.org/10.1007/978-3-030-55857-4_16