On the Size-Ramsey Number of Tight Paths

DOI10.1137/18M1170546zbMath1395.05181arXiv1712.03247WikidataQ129318490 ScholiaQ129318490MaRDI QIDQ4583428

Linyuan Lu, Zhiyu Wang

Publication date: 30 August 2018

Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1712.03247

zbMATH Keywords

hypergraphsrandom graphsize-Ramsey numbertight paths\(C_k\)-colorable graph

Mathematics Subject Classification ID

Generalized Ramsey theory (05C55) Ramsey theory (05D10)

Related Items (3)

Size Gallai-Ramsey number ⋮ The size-Ramsey number of 3-uniform tight paths ⋮ Hypergraph expanders from Cayley graphs

Cites Work

• Unnamed Item
• Explicit construction of linear sized tolerant networks
• A note on an inequality involving the normal distribution
• On the combinatorial problems which I would most like to see solved
• The size Ramsey number
• On size Ramsey number of paths, trees, and circuits. I
• 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
• Path Ramsey Number for Random Graphs
• Concentration of multivariate polynomials and its applications

This page was built for publication: On the Size-Ramsey Number of Tight Paths