Graph classes with linear Ramsey numbers

DOI10.1016/j.disc.2021.112307zbMath1460.05122arXiv1910.12109OpenAlexW3124101447MaRDI QIDQ2659214

Vadim V. Lozin, Aistis Atminas, Bogdan Alecu, Victor Zamaraev

Publication date: 25 March 2021

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1910.12109

zbMATH Keywords

bounded co-chromatic numberhomogeneous subgraphlinear Ramsey number

Mathematics Subject Classification ID

Extremal set theory (05D05) Structural characterization of families of graphs (05C75) Generalized Ramsey theory (05C55)

Related Items (4)

Pure pairs. IV: Trees in bipartite graphs ⋮ Pure pairs. VII. Homogeneous submatrices in 0/1-matrices with a forbidden submatrix ⋮ Ramsey numbers and graph parameters ⋮ Critical properties and complexity measures of read-once Boolean functions

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Graph classes and Ramsey numbers
• Extending the Gyárfás-Sumner conjecture
• Ramsey-type theorems
• Kneser's conjecture, chromatic number, and homotopy
• Paw-free graphs
• Complement reducible graphs
• Planar Ramsey numbers
• Triangle-free graphs with no six-vertex induced path
• Linear Ramsey numbers
• Graphs with no induced \(C_ 4\) and \(2K_ 2\)
• Bipartite graphs without a skew star
• Forbidden induced bipartite graphs
• A new upper bound for the bipartite Ramsey problem
• On graphs with linear Ramsey numbers
• The structure and the number of \(P_7\)-free bipartite graphs

This page was built for publication: Graph classes with linear Ramsey numbers