Triangle Ramsey numbers of complete graphs

DOI10.1016/J.JCTB.2025.08.004MaRDI QIDQ6862416zbMATH OpenFDO

Authors Jacob Fox, Jonathan Tidor, Shengtong Zhang

Publication date 9 February 2026

Published in Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/J.JCTB.2025.08.004

zbMATH Keywords

graph coloringRamsey numberssize Ramsey numbers

Mathematics Subject Classification ID

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

Cites work

• A class of Ramsey-extremal hypergraphs
• A General Upper Bound on the List Chromatic Number of Locally Sparse Graphs
• A generalized Turán problem and its applications
• Coloring graphs with sparse neighborhoods
• Counting copies of a fixed subgraph in F-free graphs
• Graph colouring and the probabilistic method
• Graphs with Monochromatic Complete Subgraphs in Every Edge Coloring
• scientific article; zbMATH DE number 3232667 (Why is no real title available?)
• scientific article; zbMATH DE number 3333194 (Why is no real title available?)
• scientific article; zbMATH DE number 3188526 (Why is no real title available?)
• scientific article; zbMATH DE number 3050594 (Why is no real title available?)
• Many \(T\) copies in \(H\)-free graphs
• On the maximum number of five-cycles in a triangle-free graph
• On the number of pentagons in triangle-free graphs
• On the size-Ramsey number of hypergraphs
• Some results on chromatic number as a function of triangle count
• Some sharp results on the generalized Turán numbers
• The maximum number of cliques in graphs without long cycles
• The size Ramsey number
• Threshold Functions for Ramsey Properties
• Triangle-free graphs with large chromatic numbers

Cited in

(1)

• On off-diagonal F-Ramsey numbers

This page was built for publication: Triangle Ramsey numbers of complete graphs

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