Effective polynomial upper bounds to perigees and numbers of (3x+d)-cycles of a given oddlength
Edward G. Belaga (2003)
Acta Arithmetica
Similarity:
Edward G. Belaga (2003)
Acta Arithmetica
Similarity:
Michal Vavroš (2002)
Acta Mathematica et Informatica Universitatis Ostraviensis
Similarity:
John L. Simons (2008)
Acta Arithmetica
Similarity:
Gleiss, Petra M., Leydold, Josef, Stadler, Peter F. (2000)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Zuzana Divišová (2002)
Mathematica Slovaca
Similarity:
B. Kaufmann (1939)
Compositio Mathematica
Similarity:
J. Węgrzyn (1971)
Applicationes Mathematicae
Similarity:
W. Puckett (1938)
Fundamenta Mathematicae
Similarity:
Hong Wang (2012)
Discussiones Mathematicae Graph Theory
Similarity:
We prove that if G is a graph of order 5k and the minimum degree of G is at least 3k then G contains k disjoint cycles of length 5.