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
Recommendations
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)
Cites Work
- Title not available (Why is that?)
- On the combinatorial problems which I would most like to see solved
- The size Ramsey number
- Long cycles in locally expanding graphs, with applications
- Title not available (Why is that?)
- The size Ramsey number of a directed path
- Paths in graphs
- The Induced Size-Ramsey Number of Cycles
- An Alternative Proof of the Linearity of the Size-Ramsey Number of Paths
- The size-Ramsey number of trees
- On size Ramsey numbers of graphs with bounded degree
- Sparse partition universal graphs for graphs of bounded degree
- Explicit construction of linear sized tolerant networks
- Title not available (Why is that?)
- The size‐Ramsey number of powers of bounded degree trees
- Path Ramsey Number for Random Graphs
- Size bipartite Ramsey numbers
- The size Ramsey number of a complete bipartite graph
- On some Multicolor Ramsey Properties of Random Graphs
- Note on the multicolour size-Ramsey number for paths
- The multicolour size-Ramsey number of powers of paths
- On the Size-Ramsey Number of Cycles
- Ordered size Ramsey number of paths
- The size‐Ramsey number of powers of paths
- The size Ramsey number of short subdivisions of bounded degree graphs
Cited In (2)
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)