A lower bound on the multicolor size-Ramsey numbers of paths in hypergraphs

DOI10.1016/J.EJC.2024.103969zbMATH Open1543.05129MaRDI QIDQ6568845

Allan Lo, Louis DeBiasio, Deepak Bal

Publication date: 8 July 2024

Published in: European Journal of Combinatorics (Search for Journal in Brave)

zbMATH Keywords

\(k\)-uniform hypergraph\(r\)-color size-Ramsey number

Mathematics Subject Classification ID

Hypergraphs (05C65) Coloring of graphs and hypergraphs (05C15) Generalized Ramsey theory (05C55) Ramsey theory (05D10)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Tight cycles and regular slices in dense hypergraphs
• Improved bounds on the multicolor Ramsey numbers of paths and even cycles
• Hypergraph extensions of the Erdős-Gallai theorem
• Asymptotic behavior of the chromatic index for hypergraphs
• The Ramsey number for hypergraph cycles. I.
• The Ramsey number of diamond-matchings and loose cycles in hypergraphs
• Ramsey numbers for the path with three edges
• Exact solution of some Turán-type problems
• Partitioning into graphs with only small components
• Note on the multicolour size-Ramsey number for paths
• New lower bounds on the size-Ramsey number of a path
• Lower bound on the size-Ramsey number of tight paths
• Three-color Ramsey numbers for paths
• Long cycles in locally expanding graphs, with applications
• Multicolor Ramsey numbers for triple systems
• New lower bounds on the multicolor Ramsey numbers \(R_{r}(C_{2m})\)
• Edge-Disjoint Spanning Trees of Finite Graphs
• The Ramsey Number for 3-Uniform Tight Hypergraph Cycles
• The Chromatic Number of Kneser Hypergraphs
• On the Size-Ramsey Number of Tight Paths
• Large hypergraphs without tight cycles
• Hypergraphs with no tight cycles
• Tight paths in convex geometric hypergraphs
• The size-Ramsey number of 3-uniform tight paths
• Hypergraphs Not Containing a Tight Tree with a Bounded Trunk
• On some Multicolor Ramsey Properties of Random Graphs
• On the Size‐Ramsey Number of Hypergraphs
• An Alternative Proof of the Linearity of the Size-Ramsey Number of Paths
• Decomposition of Finite Graphs Into Forests
• The Existence of Designs via Iterative Absorption: Hypergraph 𝐹-designs for Arbitrary 𝐹

This page was built for publication: A lower bound on the multicolor size-Ramsey numbers of paths in hypergraphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6568845)