A note on divisibility of the number of matchings of a family of graphs.
Hwang, Kyung-Won, Sheikh, Naeem N., Hartke, Stephen G. (2009)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Hwang, Kyung-Won, Sheikh, Naeem N., Hartke, Stephen G. (2009)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Broughan, Kevin A., Zhou, Qizhi (2010)
Journal of Integer Sequences [electronic only]
Similarity:
Lu, Fuliang, Zhang, Lianzhu, Lin, Fenggen (2010)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Ellis, John, Fan, Hongbing, Shallit, Jeffrey (2002)
Discrete Mathematics and Theoretical Computer Science. DMTCS [electronic only]
Similarity:
Gimbel, Steven, Jaroma, John H. (2003)
Integers
Similarity:
Wayne McDaniel (1974)
Acta Arithmetica
Similarity:
H. W., Jr. Lenstra (1977-1978)
Séminaire Delange-Pisot-Poitou. Théorie des nombres
Similarity:
Eu, Sen-Peng, Fu, Tung-Shan, Pan, Yeh-Jong (2010)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Cioabă, Sebastian M. (2004)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
McCarthy, Paul J. (1957)
Portugaliae mathematica
Similarity:
Hatami, Hamed, Hatami, Pooya (2007)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Tomohiro Yamada (2005)
Colloquium Mathematicae
Similarity:
We show that there is an effectively computable upper bound of odd perfect numbers whose Euler factors are powers of fixed exponent.