On the saturation spectrum of odd cycles

Ronald J. Gould, André Kündgen, Minjung KangJournal of Graph Theory 2023 · DOI

Abstract

Abstract Given a graph , we say that a graph is ‐saturated if is not a subgraph of , but the addition of any new edge to creates at least one copy of . In this paper we determine all pairs for which there is a ‐saturated graph on vertices and edges. In addition, we determine all but possible sizes for ‐vertex ‐saturated graphs when is an odd cycle for .
BibTeX
@article{gould2023saturation,
  author = {Ronald J. Gould and André Kündgen and Minjung Kang},
  title = {{On the saturation spectrum of odd cycles}},
  journal = {Journal of Graph Theory},
  year = {2023},
  doi = {10.1002/jgt.23052},
}

Loading related content...

Figure