Off-diagonal book Ramsey numbers

DOI10.1017/s0963548322000360zbMath1527.05168arXiv2110.14483OpenAlexW3207998522MaRDI QIDQ6091055

Jacob Fox, Yuval Wigderson, David Conlon

Publication date: 23 November 2023

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

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

zbMATH Keywords

Ramsey theoryRamsey goodnessbook graphs

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Generalized Ramsey theory (05C55) Ramsey theory (05D10)

Cites Work

• Unnamed Item
• Counting trees in graphs
• A new upper bound for diagonal Ramsey numbers
• Ramsey goodness and beyond
• A note on the independence number of triangle-free graphs
• A note on Ramsey numbers
• On finite Ramsey numbers
• The size Ramsey number
• On the connection between chromatic number, maximal clique and minimal degree of a graph
• Note on the structure of graphs with bounded clique number
• Ramsey numbers of books and quasirandomness
• Generalized Ramsey theory for graphs. III: Small off-diagonal numbers
• Generalizations of a Ramsey-theoretic result of chvátal
• The Ramsey number R(3, t) has order of magnitude t²/log t
• The Triangle-Free Process and the Ramsey Number 𝑅(3,𝑘)
• The Ramsey number of books
• Book Ramsey numbers. I
• Some remarks on the theory of graphs
• On a problem of K. Zarankiewicz
• Quasi-random graphs
• Diagonal Ramsey via effective quasirandomness
• Dynamic concentration of the triangle‐free process

This page was built for publication: Off-diagonal book Ramsey numbers