Saturation numbers for Ramsey-minimal graphs
From MaRDI portal
Publication:1800401
DOI10.1016/j.disc.2018.08.012zbMath1397.05114arXiv1808.04023OpenAlexW2963577273MaRDI QIDQ1800401
Publication date: 23 October 2018
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1808.04023
Related Items
On the size of \((K_t, K_{1, k})\)-co-critical graphs, On the size of \((K_t, P_k)\)-co-critical graphs, On the size of \((K_t,\mathcal{T}_k)\)-co-critical graphs, On the size of special class 1 graphs and \((P_3;k)\)-co-critical graphs
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On the minimum degree of minimal Ramsey graphs for multiple colours
- Saturation numbers for families of Ramsey-minimal graphs
- A survey of minimum saturated graphs
- Ramsey-minimal saturation numbers for matchings
- Recent developments in graph Ramsey theory
- The minimum degree of Ramsey-minimal graphs
- Minimalk-saturated and color critical graphs of prescribed minimum degree
- Edge-colored saturated graphs
- Onk-saturated graphs with restrictions on the degrees
- A Problem in Graph Theory
- Saturated Graphs of Prescribed Minimum Degree
- On generalized graphs