On the Erdős-Sós conjecture for graphs with circumference at most \(k+1\)
type: Item
instance of: scholarly article
title: On the Erdős-Sós conjecture for graphs with circumference at most \(k+1\)
zbMATH Open document ID: 1500.05054
DOI: 10.1007/978-3-031-05375-7_17
author: A. M. Heissan
author: Gary Tiner
publication date: 2022-10-22T00:00:00Z
Mathematics Subject Classification ID: 05C75
Mathematics Subject Classification ID: 05C05
Mathematics Subject Classification ID: 05C35
zbMATH DE Number: 7605862
zbMATH Keywords: embedding
zbMATH Keywords: average degree
MaRDI profile type: Publication
full work available at URL: 978-3-031-05375-7 17
OpenAlex ID: W4295836666
cites work: Q3114975
cites work: On the Erdős-Sós conjecture for graphs having no path with \(k+4\) vertices
cites work: Q4683335
cites work: On the Erdős-Sós conjecture for graphs with circumference at most \(k\)
cites work: The Erdős‐Sós Conjecture for trees of diameter four
cites work: Packing a tree with a graph of the same size
cites work: Q5500319
cites work: Q3114952
cites work: On the Erd�s-S�s conjecture
cites work: Q3220603
description: scientific article; zbMATH DE number 7605862