Even factors of large size
type: Item
instance of: scholarly article
zbMATH Open document ID: 1303.05153
author: Mekkia Kouider
author: Odile Favaron
published in: Journal of Graph Theory
publication date: 2014-10-09T00:00:00Z
Mathematics Subject Classification ID: 05C70
zbMATH DE Number: 6353344
zbMATH Keywords: spanning subgraph
zbMATH Keywords: even factor
MaRDI profile type: Publication
full work available at URL: jgt.21773
OpenAlex ID: W1786444062
cites work: Spanning eulerian subgraphs, the splitting lemma, and Petersen's theorem
cites work: On maximum number of edges in a spanning eulerian subgraph
cites work: Q3115063
DOI: 10.1002/JGT.21773
title: Even factors of large size
review text: An even factor of a graph is a spanning subgraph in which each vertex has a positive even degree. The main results of this paper are: (1) If \(G\) is a graph of order \(n\) and size \(m\) admitting a 2 factor, and having no even factor of size larger that \(n\), then \(m \leq 16n/9 -1\). (2) If \(G\) is a graph of size \(m\) admitting an even factor, then \(G\) contains an even factor of size at least \(9(m+1)/16\). It is open whether the factor \(9/16\) from the latter theorem is best possible, but an example is provided demonstrating that it cannot be larger than \(4/7\).
reviewed by: Sandi Klavžar
description: scientific article; zbMATH DE number 6353344