Recommendations
Cites work
- Graphs with linearly bounded Ramsey numbers
- scientific article; zbMATH DE number 4170917 (Why is no real title available?)
- scientific article; zbMATH DE number 4029619 (Why is no real title available?)
- On size Ramsey number of paths, trees, and circuits. I
- Probability Inequalities for Sums of Bounded Random Variables
- The Ramsey number of a graph with bounded maximum degree
- The size of the largest hole in a random graph
- The size Ramsey number
- The size Ramsey number of a complete bipartite graph
- The size Ramsey number of trees with bounded degree
- The size-Ramsey number of trees
Cited in
(44)- On \(K^ 4\)-free subgraphs of random graphs
- Size-Ramsey numbers of cycles versus a path
- Turán's extremal problem in random graphs: Forbidding odd cycles
- The multicolor size-Ramsey numbers of cycles
- The multicolour size-Ramsey number of powers of paths
- Lower bounds of size Ramsey number for graphs with small independence number
- A note on lower bounds for induced Ramsey numbers
- On the size Ramsey number of all cycles versus a path
- The vertex size-Ramsey number
- Size Ramsey number of bounded degree graphs for games
- Short proofs of some extremal results. II.
- On edge-ordered Ramsey numbers
- On globally sparse Ramsey graphs
- Online Ramsey theory for planar graphs
- Regular pairs in sparse random graphs I
- The size Ramsey number of short subdivisions of bounded degree graphs
- A note on the Size-Ramsey number of long subdivisions of graphs
- The size-Ramsey number of powers of bounded degree trees
- Rolling backwards can move you forward: on embedding problems in sparse expanders
- On the size-Ramsey number of cycles
- The Size Ramsey Number of Graphs with Bounded Treewidth
- On the Minimum Degree of Minimal Ramsey Graphs for Cliques Versus Cycles
- On the size-Ramsey number of grid graphs
- Short proofs for long induced paths
- Size Ramsey numbers for some regular graphs
- Induced Ramsey-type theorems
- The mod k $k$ chromatic index of random graphs
- The size‐Ramsey number of cubic graphs
- The size‐Ramsey number of short subdivisions
- Seymour's second neighborhood conjecture for orientations of (pseudo)random graphs
- Turán‐type problems for long cycles in random and pseudo‐random graphs
- On the restricted size Ramsey number for a pair of cycles
- Sparse partition universal graphs for graphs of bounded degree
- The size-Ramsey number of powers of bounded degree trees
- On the size-Ramsey number of grids
- Online Ramsey numbers: long versus short cycles
- Long induced paths in expanders
- Matching-star size Ramsey numbers under connectivity constraint
- Multicolor induced Ramsey numbers
- Induced Ramsey problems for trees and graphs with bounded treewidth
- Size-Ramsey numbers of graphs with maximum degree three
- Effective bounds for induced size-Ramsey numbers of cycles (extended abstract)
- Partition universality for hypergraphs of bounded degeneracy and degree (extended abstract)
- Turán's theorem for pseudo-random graphs
This page was built for publication: The Induced Size-Ramsey Number of Cycles
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4862744)