An Alternative Proof of the Linearity of the Size-Ramsey Number of Paths
From MaRDI portal
Publication:5364242
DOI10.1017/S096354831400056XzbMath1371.05172arXiv1405.1663WikidataQ105585042 ScholiaQ105585042MaRDI QIDQ5364242
Publication date: 4 October 2017
Published in: Combinatorics, Probability and Computing (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1405.1663
Related Items (30)
The vertex size-Ramsey number ⋮ On the size-Ramsey number of grid graphs ⋮ Short proofs for long induced paths ⋮ Large monochromatic components and long monochromatic cycles in random hypergraphs ⋮ On the size Ramsey number of all cycles versus a path ⋮ Note on the multicolour size-Ramsey number for paths ⋮ On the Size-Ramsey Number of Tight Paths ⋮ On the restricted size Ramsey number involving a path \(P_3\) ⋮ The size‐Ramsey number of short subdivisions ⋮ On some Multicolor Ramsey Properties of Random Graphs ⋮ Random bipartite Ramsey numbers of long cycles ⋮ The multicolour size-Ramsey number of powers of paths ⋮ Path Ramsey Number for Random Graphs ⋮ Bipartite Ramsey numbers of paths for random graphs ⋮ On-line size Ramsey number for monotone \(k\)-uniform ordered paths with uniform looseness ⋮ Perfect matchings and Hamiltonian cycles in the preferential attachment model ⋮ The size Ramsey number of short subdivisions of bounded degree graphs ⋮ On-line Ramsey numbers of paths and cycles ⋮ Lower bounds of size Ramsey number for graphs with small independence number ⋮ Ramsey Goodness of Clique Versus Paths in Random Graphs ⋮ Size-Ramsey numbers of cycles versus a path ⋮ The size-Ramsey number of 3-uniform tight paths ⋮ Size Ramsey number of bipartite graphs and bipartite Ramanujan graphs ⋮ Bipartite Ramsey numbers of cycles for random graphs ⋮ On the Size-Ramsey Number of Cycles ⋮ Ordered size Ramsey number of paths ⋮ New lower bounds on the size-Ramsey number of a path ⋮ The size‐Ramsey number of powers of bounded degree trees ⋮ The Size Ramsey Number of Graphs with Bounded Treewidth ⋮ The multicolor size-Ramsey numbers of cycles
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Partitioning edge-coloured complete graphs into monochromatic cycles and paths
- Explicit construction of linear sized tolerant networks
- 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
- Paths in graphs
- Path Ramsey Number for Random Graphs
This page was built for publication: An Alternative Proof of the Linearity of the Size-Ramsey Number of Paths
