Induced saturation number

DOI10.1016/j.disc.2012.06.015zbMath1251.05082arXiv1112.1923OpenAlexW2025125798MaRDI QIDQ456647

Jason J. Smith, Ryan R. Martin

Publication date: 16 October 2012

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1112.1923

zbMATH Keywords

induced subgraphssaturationBoolean formulastrigraphs

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35)

Related Items (6)

Graphs with induced-saturation number zero ⋮ \(P_n\)-induced-saturated graphs exist for all \(n \geqslant 6\) ⋮ Induced saturation of graphs ⋮ On induced saturation for paths ⋮ The saturation number of induced subposets of the Boolean lattice ⋮ Induced saturation of \(P_6\)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A survey of minimum saturated graphs
• Edit distance and its computation
• tK\(_p\)-saturated graphs of minimum size
• Minimum C₅‐saturated graphs
• Saturated graphs with minimal number of edges
• A Problem in Graph Theory
• Berge trigraphs

This page was built for publication: Induced saturation number