2000 character limit reached
Generalized Ramsey numbers of cycles, paths, and hypergraphs (2405.15904v2)
Published 24 May 2024 in math.CO
Abstract: Given a $k$-uniform hypergraph $G$ and a set of $k$-uniform hypergraphs $\mathcal{H}$, the generalized Ramsey number $f(G,\mathcal{H},q)$ is the minimum number of colors needed to edge-color $G$ so that every copy of every hypergraph $H\in \mathcal{H}$ in $G$ receives at least $q$ different colors. In this note we obtain bounds, some asymptotically sharp, on several generalized Ramsey numbers, when $G=K_n$ or $G=K_{n,n}$ and $\mathcal{H}$ is a set of cycles or paths, and when $G=K_nk$ and $\mathcal{H}$ contains a clique on $k+2$ vertices or a tight cycle.
- N. Alon and J. H. Spencer. The probabilistic method. Wiley Series in Discrete Mathematics and Optimization. John Wiley & Sons, Inc., Hoboken, NJ, fourth edition, 2016.
- M. Axenovich. A generalized Ramsey problem. Discrete Mathematics, 222(1-3):247–249, 2000.
- On generalized Ramsey theory: The bipartite case. Journal of Combinatorial Theory, Series B, 79(1):66–86, 2000.
- Lower bounds on the Erdős–Gyárfás problem via color energy graphs. Journal of Graph Theory, 103(2):378–409, 2023.
- The Erdős–Gyárfás function f(n,4,5)=56n+o(n)𝑓𝑛4556𝑛𝑜𝑛f(n,4,5)=\frac{5}{6}n+o(n)italic_f ( italic_n , 4 , 5 ) = divide start_ARG 5 end_ARG start_ARG 6 end_ARG italic_n + italic_o ( italic_n ) – so Gyárfás was right. arXiv:2207.02920, 2022.
- On generalized Ramsey numbers in the sublinear regime. arXiv:2212.10542, 2022.
- A random coloring process gives improved bounds for the Erdős–Gyárfás problem on generalized Ramsey numbers. arXiv:2212.06957, 2022.
- Edge-coloring a graph G𝐺Gitalic_G so that every copy of a graph H𝐻Hitalic_H has an odd color class. arXiv:2307.01314, 2023.
- A. Cameron and E. Heath. A (5,5)55(5,5)( 5 , 5 )-colouring of Knsubscript𝐾𝑛{K}_{n}italic_K start_POSTSUBSCRIPT italic_n end_POSTSUBSCRIPT with few colours. Combinatorics, Probability and Computing, 27(6):892–912, 2018.
- A. Cameron and E. Heath. New upper bounds for the Erdős–Gyárfás problem on generalized Ramsey numbers. Combinatorics, Probability and Computing, 32(2):349–362, 2023.
- The Erdős–Gyárfás problem on generalized Ramsey numbers. Proceedings of the London Mathematical Society, 110(1):1–18, 2015.
- M. Delcourt and L. Postle. Finding an almost perfect matching in a hypergraph avoiding forbidden submatchings. arXiv:2204.08981, 2022.
- P. Erdős and A. Gyárfás. A variant of the classical Ramsey problem. Combinatorica, 17(4):459–467, 1997.
- Path Ramsey numbers in multicolorings. J. Combinatorial Theory Ser. B, 19(2):150–160, 1975.
- Tight paths in convex geometric hypergraphs. Adv. Comb., pages Paper No. 1, 14, 2020.
- Conflict-free hypergraph matchings. In Proceedings of the 2023 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pages 2991–3005. SIAM, 2023.
- An extremal problem for paths in bipartite graphs. J. Graph Theory, 8(1):83–95, 1984.
- F. Joos and D. Mubayi. Ramsey theory constructions from hypergraph matchings. arXiv:2208.12563, 2022.
- R. A. Krueger. Generalized Ramsey numbers: Forbidding paths with few colors. Electronic Journal of Combinatorics, 27(1):Paper No. 1.44, 10, 2020.
- C. McDiarmid et al. On the method of bounded differences. Surveys in combinatorics, 141(1):148–188, 1989.
- D. Mubayi. Edge-coloring cliques with three colors on all 4-cliques. Combinatorica, 18(2):293–296, 1998.
- D. Mubayi. An explicit construction for a Ramsey problem. Combinatorica, 24(2):313–324, 2004.
Sponsor
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.