Lower bounds of size Ramsey number for graphs with small independence number

DOI10.1007/S10255-021-1047-3zbMATH Open1477.05123OpenAlexW3205218033MaRDI QIDQ2240666FDOQ2240666

Authors Chunlin You

Publication date 4 November 2021

Published in Acta Mathematicae Applicatae Sinica. English Series (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s10255-021-1047-3

zbMATH Keywords

probabilistic methodaffine planesize Ramsey number

Mathematics Subject Classification ID

Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Generalized Ramsey theory (05C55) Ramsey theory (05D10) Probabilistic methods in extremal combinatorics, including polynomial methods (combinatorial Nullstellensatz, etc.) (05D40)

Recommendations

• The size‐Ramsey number of powers of paths
• The size-Ramsey number of powers of bounded degree trees
• Ramsey Numbers and the Size of Graphs
• Lower bounds for lower Ramsey numbers
• The multicolour size-Ramsey number of powers of paths

Cites work

• scientific article; zbMATH DE number 4170917 (Why is no real title available?)
• scientific article; zbMATH DE number 3961650 (Why is no real title available?)
• scientific article; zbMATH DE number 16104 (Why is no real title available?)
• An alternative proof of the linearity of the size-Ramsey number of paths
• Explicit construction of linear sized tolerant networks
• Long cycles in locally expanding graphs, with applications
• Note on the multicolour size-Ramsey number for paths
• On size Ramsey numbers of graphs with bounded degree
• On some multicolor Ramsey properties of random graphs
• On the combinatorial problems which I would most like to see solved
• On the size-Ramsey number of cycles
• Ordered size Ramsey number of paths
• Path Ramsey number for random graphs
• Paths in graphs
• Size bipartite Ramsey numbers
• Sparse partition universal graphs for graphs of bounded degree
• The Induced Size-Ramsey Number of Cycles
• The multicolour size-Ramsey number of powers of paths
• The size Ramsey number
• The size Ramsey number of a complete bipartite graph
• The size Ramsey number of a directed path
• The size Ramsey number of short subdivisions of bounded degree graphs
• The size-Ramsey number of powers of bounded degree trees
• The size-Ramsey number of trees
• The size‐Ramsey number of powers of paths

Cited in

(2)

• Lower bounds for small Ramsey numbers on hypergraphs
• Lower bound on the size-Ramsey number of tight paths

This page was built for publication: Lower bounds of size Ramsey number for graphs with small independence number

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2240666)