The Induced Size-Ramsey Number of Cycles

DOI10.1017/S0963548300001619zbMATH Open0839.05073WikidataQ105583860 ScholiaQ105583860MaRDI QIDQ4862744FDOQ4862744

Authors: Penny Haxell, Yoshiharu Kohayakawa, Tomasz Łuczak 

Publication date: 18 June 1996

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

Recommendations

• On the size-Ramsey number of cycles
• Size-Ramsey numbers of cycles versus a path
• The multicolor size-Ramsey numbers of cycles
• Induced Ramsey numbers
• scientific article; zbMATH DE number 2197902

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) Graph algorithms (graph-theoretic aspects) (05C85) Paths and cycles (05C38) Generalized Ramsey theory (05C55)

Cites Work

• Probability Inequalities for Sums of Bounded Random Variables
• Title not available (Why is that?)
• The size Ramsey number
• On size Ramsey number of paths, trees, and circuits. I
• The size-Ramsey number of trees
• The Ramsey number of a graph with bounded maximum degree
• Title not available (Why is that?)
• Graphs with linearly bounded Ramsey numbers
• The size Ramsey number of trees with bounded degree
• The size Ramsey number of a complete bipartite graph
• The size of the largest hole in a random graph

Cited In (37)

• The size‐Ramsey number of cubic graphs
• On globally sparse Ramsey graphs
• The size‐Ramsey number of powers of bounded degree trees
• The vertex size-Ramsey number
• Lower bounds of size Ramsey number for graphs with small independence number
• Sparse partition universal graphs for graphs of bounded degree
• The size‐Ramsey number of short subdivisions
• Seymour's second neighborhood conjecture for orientations of (pseudo)random graphs
• The mod k $k$ chromatic index of random graphs
• A note on lower bounds for induced Ramsey numbers
• The size Ramsey number of short subdivisions of bounded degree graphs
• Regular pairs in sparse random graphs I
• Short proofs for long induced paths
• Turán‐type problems for long cycles in random and pseudo‐random graphs
• Size Ramsey numbers for some regular graphs
• Short proofs of some extremal results. II.
• The size-Ramsey number of powers of bounded degree trees
• Online Ramsey theory for planar graphs
• On the size-Ramsey number of grids
• On the restricted size Ramsey number for a pair of cycles
• Induced Ramsey-type theorems
• On the size-Ramsey number of grid graphs
• A note on the Size-Ramsey number of long subdivisions of graphs
• The multicolor size-Ramsey numbers of cycles
• On the size Ramsey number of all cycles versus a path
• Size Ramsey number of bounded degree graphs for games
• On \(K^ 4\)-free subgraphs of random graphs
• Online Ramsey numbers: long versus short cycles
• The Size Ramsey Number of Graphs with Bounded Treewidth
• The multicolour size-Ramsey number of powers of paths
• Size-Ramsey numbers of cycles versus a path
• Turán's theorem for pseudo-random graphs
• Turán's extremal problem in random graphs: Forbidding odd cycles
• Rolling backwards can move you forward: On embedding problems in sparse expanders
• On edge‐ordered Ramsey numbers
• On the Size-Ramsey Number of Cycles
• On the Minimum Degree of Minimal Ramsey Graphs for Cliques Versus Cycles

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)