The Induced Size-Ramsey Number of Cycles

DOI10.1017/S0963548300001619zbMath0839.05073WikidataQ105583860 ScholiaQ105583860MaRDI QIDQ4862744

Tomasz Łuczak, Penny E. Haxell, Yoshiharu Kohayakawa

Publication date: 18 June 1996

Published in: Combinatorics, Probability and Computing (Search for Journal in Brave)

zbMATH Keywords

cyclerandom graphspath\(r\)-induced Ramsey number\(r\)-size-Ramsey numberconjecture of Graham and Rödlregularity lemma of Szemerédi

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Paths and cycles (05C38) Generalized Ramsey theory (05C55) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (34)

The vertex size-Ramsey number ⋮ 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 ⋮ Short proofs of some extremal results. II. ⋮ Turán's extremal problem in random graphs: Forbidding odd cycles ⋮ Rolling backwards can move you forward: On embedding problems in sparse expanders ⋮ On the size Ramsey number of all cycles versus a path ⋮ Turán's theorem for pseudo-random graphs ⋮ On \(K^ 4\)-free subgraphs of random graphs ⋮ On globally sparse Ramsey graphs ⋮ A note on lower bounds for induced Ramsey numbers ⋮ The mod k $k$ chromatic index of random graphs ⋮ The size‐Ramsey number of cubic graphs ⋮ The size‐Ramsey number of short subdivisions ⋮ Online Ramsey theory for planar graphs ⋮ 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 ⋮ The multicolour size-Ramsey number of powers of paths ⋮ Sparse partition universal graphs for graphs of bounded degree ⋮ The size Ramsey number of short subdivisions of bounded degree graphs ⋮ Lower bounds of size Ramsey number for graphs with small independence number ⋮ Induced Ramsey-type theorems ⋮ Size Ramsey numbers for some regular graphs ⋮ Size-Ramsey numbers of cycles versus a path ⋮ A note on the Size-Ramsey number of long subdivisions of graphs ⋮ Regular pairs in sparse random graphs I ⋮ On edge‐ordered Ramsey numbers ⋮ On the Size-Ramsey Number of Cycles ⋮ Size Ramsey Number of Bounded Degree Graphs for Games ⋮ 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
• The Ramsey number of a graph with bounded maximum degree
• The size of the largest hole in a random graph
• The size Ramsey number
• Graphs with linearly bounded Ramsey numbers
• The size Ramsey number of a complete bipartite graph
• The size Ramsey number of trees with bounded degree
• On size Ramsey number of paths, trees, and circuits. I
• Probability Inequalities for Sums of Bounded Random Variables
• The size-Ramsey number of trees

This page was built for publication: The Induced Size-Ramsey Number of Cycles