The partite saturation number of spider

Feifei Song and Jianjie Zhou

Applied Mathematics and Computation, 2021, vol. 394, issue C

Abstract: Let H[n] denote the blow-up of H onto parts of size n. A copy of H in H[n] is partite if it has one vertex in each part of H[n]. It is an interesting question that how few edges a subgraph G of H[n] can have such that G has no partite copy of H but the addition of any new edge from H[n] creates a partite H. A spider graph is a tree having at most one vertex with degree greater than two. This paper considers the partite saturation number of spiders, which can be seen as an extension of the results for stars and paths in [22].

Keywords: Extremal graph theory; Partite graph saturation; Spider (search for similar items in EconPapers)
Date: 2021
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (1)

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0096300320307463
Full text for ScienceDirect subscribers only

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:eee:apmaco:v:394:y:2021:i:c:s0096300320307463

DOI: 10.1016/j.amc.2020.125793

Access Statistics for this article

Applied Mathematics and Computation is currently edited by Theodore Simos

More articles in Applied Mathematics and Computation from Elsevier
Bibliographic data for series maintained by Catherine Liu ().