On fan-saturated graphs

Fuller, Jessica; Gould, Ronald J.

doi:10.2140/involve.2023.16.637

Download this article
	For screen
	For printing

Recent Issues

The Journal

Submission Guidelines

Submission Form

Policies for Authors

Ethics Statement

ISSN: 1944-4184 (e-only)

ISSN: 1944-4176 (print)

Author Index

Coming Soon

Other MSP Journals

This article is available for purchase or by subscription. See below.

On fan-saturated graphs

Jessica Fuller and Ronald J. Gould

Vol. 16 (2023), No. 4, 637–657

DOI: 10.2140/involve.2023.16.637

Abstract

Given a graph $H$ , we say that a graph $G$ is $H$ -saturated if it does not contain $H$ as a subgraph, but the addition of any edge $e \notin E (G)$ would result in at least one copy of $H$ as a subgraph. Let $F_{t}$ be the graph consisting of $t$ edge-disjoint triangles that intersect at a single vertex $v$ . We investigate the set of all $m$ such that there exists an $n$ -vertex, $m$ -edge $F_{t}$ -saturated graph for $t \geq 2$ . This set is called the saturation spectrum of $F_{t}$ . For example, there exists an $F_{2}$ -saturated graph $G$ on $n \geq 10$ vertices and $m$ edges if $m = n + 2$ , or

2 n - 3 \leq m \leq ⌈ \frac{n + 5}{2} ⌉ ⌊ \frac{n - 5}{2} ⌋ + 3 ⌊ \frac{n - 5}{2} ⌋ + 4,

or $m = p (n - p) + 1$ , the size of the complete bipartite graph with one additional edge, or $m = n^{2} ∕ 4 - n - x^{2} + 1$ , $x \geq 1$ .

PDF Access Denied

We have not been able to recognize your IP address 3.147.47.82 as that of a subscriber to this journal.
Online access to the content of recent issues is by subscription, or purchase of single articles.

Please contact your institution's librarian suggesting a subscription, for example by using our journal-recommendation form. Or, visit our subscription page for instructions on purchasing a subscription.

You may also contact us at contact@msp.org
or by using our contact form.

Or, you may purchase this single article for USD 30.00:

Keywords

fan, saturation, saturation spectrum

Mathematical Subject Classification

Primary: 05C35

Milestones

Received: 17 May 2022

Revised: 3 October 2022

Accepted: 6 October 2022

Published: 31 October 2023

Communicated by Ann N. Trenk

Authors

Jessica Fuller
Department of Mathematics University of Connecticut Stamford, CT United States

Ronald J. Gould
Department of Mathematics and Computer Science Emory University Atlanta, GA United States

Vol. 16, No. 4, 2023