Affordable Access

Cubic Graphs, Disjoint Matchings and Some Inequalities

Authors
  • Hambardzumyan, Lianna
  • Mkrtchyan, Vahan
Type
Preprint
Publication Date
Dec 08, 2015
Submission Date
Dec 08, 2015
Identifiers
arXiv ID: 1512.02546
Source
arXiv
License
Yellow
External links

Abstract

For $k = 2,3$ and a cubic graph $G$ let $\nu_k(G)$ denote the size of a maximum $k$-edge-colorable subgraph of $G$. Mkrtchyan, Petrosyan and Vardanyan proved that $\nu_2(G)\geq \frac45\cdot |V(G)|$, $\nu_3(G)\geq \frac76\cdot |V(G)|$ ~\cite{samvel:2010}. They were also able to show that $\nu_2(G)+\nu_3(G)\geq 2\cdot |V(G)|$ ~\cite{samvel:2014} and $\nu_2(G) \leq \frac{|V(G)| + 2\cdot \nu_3(G)}{4}$ ~\cite{samvel:2010}. In the present work, we show that the last two inequalities imply the first two of them. Moreover, we show that $\nu_2(G) \geq \alpha \cdot \frac{|V(G)| + 2\cdot \nu_3(G)}{4} $, where $\alpha=\frac{16}{17}$, if $G$ is a cubic graph, $\alpha=\frac{20}{21}$, if $G$ is a cubic graph containing a perfect matching, $\alpha=\frac{44}{45}$, if $G$ is a bridgeless cubic graph. \\ Finally, we investigate the parameters $\nu_2(G)$ and $\nu_3(G)$ in the class of claw-free cubic graphs. We improve the lower bounds for $\nu_2(G)$ and $\nu_3(G)$ for claw-free bridgeless cubic graphs to $\nu_2(G)\geq \frac{29}{30}\cdot |V(G)|$, $\nu_3(G)\geq \frac{43}{45}\cdot |E(G)|$. We also show that $\nu_2(G) \geq \frac{35}{36} \cdot |V(G)|$ when $n \geq 48$. On the basis of these inequalities we are able to improve the coefficient $\alpha$ for bridgeless claw-free cubic graphs.

Report this publication

Statistics

Seen <100 times