Vertex-disjoint cycles of the same length
type: Item
instance of: scholarly article
title: Vertex-disjoint cycles of the same length
zbMATH Open document ID: 0855.05076
author: Yoshimi Egawa
published in: Journal of Combinatorial Theory. Series B
publication date: 1996-10-14T00:00:00Z
review text: It is shown that for each integer \(k\geq 3\), there exists an integer \(p_k\) such that every graph with minimum degree at least \(2k\) and order at least \(p_k\) contains \(k\) pairwise vertex-disjoint cycles of the same length. The question of whether the same holds for \(k= 2\) remains open.
Mathematics Subject Classification ID: 05C38
zbMATH DE Number: 934788
zbMATH Keywords: minimum degree
zbMATH Keywords: order
zbMATH Keywords: cycles
MaRDI profile type: Publication
full work available at URL: jctb.1996.0015
OpenAlex ID: W2015810078
DOI: 10.1006/JCTB.1996.0015
description: scientific article; zbMATH DE number 934788