Deleting Edges from Ramsey Minimal Examples
From MaRDI portal
Abstract: If r(s, t) = p, we shall call Kp a Ramsey Minimal Example. We prove that if r{s,t) = p, and one edge is deleted from the Ramsey Minimal Example, Kp, the resulting graph no longer has the Ramsey property, that is, its edges can be colored red or blue so that the "red" subgraph does not contain Ks and the "blue" subgraph does not contain Kt. The paper is written in an accessible style explaining the process that led us to make the conjecture and then prove this result.
Recommendations
- Deleting edges from Ramsey graphs
- Destroying the Ramsey property by the removal of edges
- Bounds for Ramsey numbers of complete graphs dropping an edge
- Maximum clique deleted from Ramsey graphs of a graph and paths
- On Ramsey minimal graphs
- On Ramsey minimal graphs
- On Ramsey Minimal Graphs
- Making an arbitrary filled graph minimal by removing fill edges
- Minimal Ramsey graphs on deleting stars for generalized fans and books
Cited in
(9)- Destroying bicolored \(P_3\)s by deleting few edges
- Making an arbitrary filled graph minimal by removing fill edges
- Destroying Bicolored $P_3$s by Deleting Few Edges
- Computation of new diagonal graph Ramsey numbers
- Star-critical Gallai-Ramsey numbers involving the disjoint union of triangles
- Multicolor star-critical Ramsey numbers and Ramsey-good graphs
- Destroying the Ramsey property by the removal of edges
- Ramsey's Theorem Is Sharp
- Ramsey numbers upon vertex deletion
This page was built for publication: Deleting Edges from Ramsey Minimal Examples
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3459998)
