Ramsey numbers upon vertex deletion

DOI10.1002/JGT.23093MaRDI QIDQ6540257zbMATH OpenFDO

Authors Yuval Wigderson

Publication date 15 May 2024

Published in Journal of Graph Theory (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

zbMATH Keywords

Ramsey numbervertex deletionTurán coloring

Mathematics Subject Classification ID

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

Recommendations

• Destroying the Ramsey property by the removal of edges
• Deleting edges from Ramsey graphs
• Deleting Edges from Ramsey Minimal Examples
• A conjecture of Erdős on graph Ramsey numbers
• Ramsey numbers of degenerate graphs

Cites work

• scientific article; zbMATH DE number 3893206 (Why is no real title available?)
• A combinatorial problem in geometry.
• An improved lower bound for multicolor Ramsey numbers and a problem of Erdős
• An improved lower bound on multicolor Ramsey numbers
• Density theorems for bipartite graphs and related Ramsey-type results
• Lower bounds for multicolor Ramsey numbers
• On a Ramsey type theorem
• Short proofs of some extremal results. III
• Unavoidable chromatic patterns in 2‐colorings of the complete graph
• Unavoidable patterns
• Unavoidable patterns in locally balanced colourings
• Unavoidable subgraphs of colored graphs

Cited in

(1)

• Graphs with arbitrary Ramsey number and connectivity

This page was built for publication: Ramsey numbers upon vertex deletion

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