We prove that ifG is a graph of order at least 2k with k≥9 and the minimum degree of G is at least k + 1,then G contains two vertex-disjoint cycles of order at least k.Moreover,the condition on the minimum degree is ...We prove that ifG is a graph of order at least 2k with k≥9 and the minimum degree of G is at least k + 1,then G contains two vertex-disjoint cycles of order at least k.Moreover,the condition on the minimum degree is sharp.展开更多
基金supported by National Security Agent of USA(Grant No.H98230-08-10098)
文摘We prove that ifG is a graph of order at least 2k with k≥9 and the minimum degree of G is at least k + 1,then G contains two vertex-disjoint cycles of order at least k.Moreover,the condition on the minimum degree is sharp.
