English

Induced 2-Regular Subgraphs in k-Chordal Cubic Graphs

Combinatorics 2014-06-11 v1

Abstract

We show that a cubic graph GG of order nn has an induced 22-regular subgraph of order at least a) n244k\frac{n-2}{4-\frac{4}{k}}, if GG has no induced cycle of length more than kk, b) 5n+68\frac{5n+6}{8}, if GG has no induced cycle of length more than 44, and n>6n>6, and c) (14+ϵ)n\left(\frac{1}{4}+\epsilon\right)n, if the independence number of GG is at most (38ϵ)n\left(\frac{3}{8}-\epsilon\right)n. To show the second result we give a precise structural description of cubic 44-chordal graphs.

Keywords

Cite

@article{arxiv.1406.2438,
  title  = {Induced 2-Regular Subgraphs in k-Chordal Cubic Graphs},
  author = {Michael A. Henning and Felix Joos and Christian Löwenstein and Dieter Rautenbach},
  journal= {arXiv preprint arXiv:1406.2438},
  year   = {2014}
}

Comments

10 pages

R2 v1 2026-06-22T04:34:44.508Z