Ramsey numbers upon vertex deletion

DOI10.1002/JGT.23093zbMATH Open1539.05098MaRDI QIDQ6540257

Yuval Wigderson

Publication date: 15 May 2024

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

zbMATH Keywords

Ramsey numbervertex deletionTurán coloring

Mathematics Subject Classification ID

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

Cites Work

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

Related Items (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)