Zobrazeno 1 - 10
of 15
pro vyhledávání: '"Albert D. Polimeni"'
This is the eBook of the printed book and may not include any media, website access codes, or print supplements that may come packaged with the bound book. For courses in Transition to Advanced Mathematics or Introduction to Proof. Meticulously craft
Mathematical Proofs: A Transition to Advanced Mathematics
Autor:
Shahin Amrahov, Sung Soo Kim, Mihai Manea, Ali Nabi Duman, Costas Efthimiou, Peter Hilton, Bill Chen, Clark Kimberling, Paul R. Pudaite, William P. Wardlaw, Erwin Just, Norman Schaumberger, Michael G. Neubauer, Heinz-Jürgen Seiffert, Reza Akhlaghi, Tsehaye Andebrhan, Michael Andreoli, Carl Axness, Michel Bataille, Jean Bogaert, Minh Can, Mario Catalani, Knut Dale, Daniele Donini, Robert L. Doucette, Peter Drianov, Aaron Dutle, Ovidiu Furdui, Julien Grivaux, Enkel Hysnelaj, Steve Kaczkowski, Achim Kehrein, Murray S. Klamkin, Elias Lampakis, Kee-Wai Lau, Albert D. Polimeni, Rob Pratt, Phillip P. Ray, Rolf Richberg, Joel Schlosberg, Harry Sedinger, Achilleas Sinefakopoulos, Nicholas C. Singer, John W. Spellmann, Nora Thornber, Dave Trautman, Chu Wenchang, Magli Pierluigi, Michael Vowe, John T. Zerger, Li Zhou, Tim Ferguson, Lenny Jones, Chip Curtis, Roy Barbara, Kathleen E. Lewis, Reiner Martin, Bill Mixon, Mihàly Bencze, Herb Bailey, Daniel Donini, John G. Heuver, Vivek Kumar Mehra, Peter E. Nüesch, Raul A. Simon, Helen Skala
Publikováno v:
Mathematics Magazine. 77:69
Publikováno v:
The American Mathematical Monthly. 105:273
Publikováno v:
Fundamenta Mathematicae. 95:189-194
Publikováno v:
Journal of Graph Theory. 5:363-369
For an arbitrary tree T of order m and an arbitrary positive integer n, Chvatal proved that the Ramsey number r(T, Kn) = 1 + (m − 1) (n − 1). for graphs G, G1, and G2, we say that G arrows G1 and G2, written G (G1, G2), if for every factorization
Publikováno v:
Israel Journal of Mathematics. 33:5-8
A graphG is locallyn-connected,n≧1, if the subgraph induced by the neighborhood of each vertex isn-connected. It is shown that every connected, locally 3-connected graph containing no induced subgraph isomorphic toK(1, 3) is hamiltonian-connected.
Autor:
Gary Chartrand, Albert D. Polimeni
Publikováno v:
Pacific J. Math. 55, no. 1 (1974), 39-43
Publikováno v:
Journal of Graph Theory. 4:233-239
A formula is presented for the ramsey number of any forest of order at least 3 versus any graph G of order n ≥ 4 having clique number n - 1. In particular, if T is a tree of order m ≥ 3, then r(T, G) = 1 + (m - 1)(n - 2).
Autor:
Albert D. Polimeni
Publikováno v:
Journal of the Australian Mathematical Society. 7:172-176
A group G is called a c-group if each of its subnormal subgroups is characteristic in G. It is the object of this note to give a characterization of finite solvable c-groups.